./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/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 1952eae46575e60399f761afaedbe356b8f81a96 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/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 1952eae46575e60399f761afaedbe356b8f81a96 .............................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:53,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:53,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:53,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:53,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:53,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:53,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:53,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:53,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:53,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:53,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:53,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:53,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:53,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:53,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:53,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:53,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:53,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:53,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:53,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:53,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:53,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:53,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:53,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:53,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:53,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:53,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:53,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:53,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:53,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:53,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:53,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:53,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:53,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:53,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:53,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:53,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:53,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:53,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:53,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:53,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:53,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:53,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:53,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:53,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:53,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:53,462 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:53,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:53,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:53,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:53,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:53,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:53,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:53,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:53,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:53,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:53,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:53,466 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:53,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:53,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:53,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:53,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:53,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:53,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:53,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:53,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:53,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:53,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:53,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:53,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:53,468 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_801849cc-b503-4f68-94bd-94883a2adf31/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-25 08:49:53,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:53,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:53,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:53,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:53,633 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:53,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-25 08:49:53,691 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/b6daff0cd/158edc92516b4923a74984c50fb0912f/FLAGbe4c0da03 [2019-11-25 08:49:54,155 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:54,155 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-25 08:49:54,176 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/b6daff0cd/158edc92516b4923a74984c50fb0912f/FLAGbe4c0da03 [2019-11-25 08:49:54,400 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/b6daff0cd/158edc92516b4923a74984c50fb0912f [2019-11-25 08:49:54,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:54,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:54,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:54,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:54,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:54,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:54" (1/1) ... [2019-11-25 08:49:54,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6db66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:54, skipping insertion in model container [2019-11-25 08:49:54,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:54" (1/1) ... [2019-11-25 08:49:54,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:54,487 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:54,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:54,942 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:55,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:55,103 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:55,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55 WrapperNode [2019-11-25 08:49:55,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:55,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:55,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:55,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:55,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:55,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:55,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:55,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:55,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:55,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:55,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:55,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:55,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:49:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:49:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:49:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:49:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:55,670 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:49:56,607 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-25 08:49:56,607 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-25 08:49:56,608 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:56,608 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:49:56,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:56 BoogieIcfgContainer [2019-11-25 08:49:56,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:56,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:56,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:56,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:56,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:54" (1/3) ... [2019-11-25 08:49:56,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e21061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:56, skipping insertion in model container [2019-11-25 08:49:56,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55" (2/3) ... [2019-11-25 08:49:56,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e21061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:56, skipping insertion in model container [2019-11-25 08:49:56,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:56" (3/3) ... [2019-11-25 08:49:56,620 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-11-25 08:49:56,626 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:56,631 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:49:56,638 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:49:56,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:56,659 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:56,659 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:56,659 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:56,659 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:56,659 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:56,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:56,660 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-25 08:49:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:49:56,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:56,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:56,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-25 08:49:56,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:56,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825790360] [2019-11-25 08:49:56,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:56,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825790360] [2019-11-25 08:49:56,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:56,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:56,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58073056] [2019-11-25 08:49:56,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:56,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:56,984 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-25 08:49:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:57,519 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-25 08:49:57,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:57,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-25 08:49:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:57,534 INFO L225 Difference]: With dead ends: 313 [2019-11-25 08:49:57,534 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:49:57,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:49:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-25 08:49:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:49:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-25 08:49:57,591 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-25 08:49:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:57,591 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-25 08:49:57,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-25 08:49:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 08:49:57,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:57,594 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:57,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-25 08:49:57,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:57,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352712930] [2019-11-25 08:49:57,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:57,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352712930] [2019-11-25 08:49:57,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:57,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:57,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558066520] [2019-11-25 08:49:57,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:57,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:57,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:57,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:57,758 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-25 08:49:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:58,161 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-25 08:49:58,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:58,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-25 08:49:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,164 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:49:58,164 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:49:58,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:49:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-25 08:49:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:49:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-25 08:49:58,184 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-25 08:49:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:58,185 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-25 08:49:58,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-25 08:49:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:49:58,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:58,195 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:58,196 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-25 08:49:58,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:58,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461587756] [2019-11-25 08:49:58,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:58,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461587756] [2019-11-25 08:49:58,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:58,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:58,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705316231] [2019-11-25 08:49:58,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:58,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:58,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:58,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:58,325 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-25 08:49:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:58,694 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-25 08:49:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:58,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:49:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,697 INFO L225 Difference]: With dead ends: 279 [2019-11-25 08:49:58,697 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 08:49:58,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 08:49:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-25 08:49:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:49:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-25 08:49:58,712 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-25 08:49:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:58,713 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-25 08:49:58,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-25 08:49:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:49:58,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:58,714 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:58,715 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-25 08:49:58,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:58,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599474575] [2019-11-25 08:49:58,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:58,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599474575] [2019-11-25 08:49:58,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:58,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:58,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641649921] [2019-11-25 08:49:58,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:58,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:58,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:58,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:58,829 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-25 08:49:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:59,217 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-25 08:49:59,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:59,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:49:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:59,219 INFO L225 Difference]: With dead ends: 277 [2019-11-25 08:49:59,220 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 08:49:59,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 08:49:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-25 08:49:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:49:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-25 08:49:59,236 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-25 08:49:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:59,236 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-25 08:49:59,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-25 08:49:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:49:59,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:59,237 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,238 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-25 08:49:59,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720915453] [2019-11-25 08:49:59,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:59,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720915453] [2019-11-25 08:49:59,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:59,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:59,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770811113] [2019-11-25 08:49:59,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:59,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:59,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:59,333 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-25 08:49:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:59,658 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-25 08:49:59,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:59,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:49:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:59,660 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:49:59,660 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:49:59,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:49:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:49:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:49:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-25 08:49:59,669 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-25 08:49:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:59,670 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-25 08:49:59,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-25 08:49:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:49:59,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:59,671 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,671 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-25 08:49:59,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546018220] [2019-11-25 08:49:59,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:59,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546018220] [2019-11-25 08:49:59,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:59,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:59,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468403816] [2019-11-25 08:49:59,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:59,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:59,735 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-25 08:50:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,049 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-25 08:50:00,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:00,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:50:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,051 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:50:00,052 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:50:00,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:50:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:50:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:50:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-25 08:50:00,058 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-25 08:50:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:00,058 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-25 08:50:00,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-25 08:50:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:50:00,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:00,059 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:00,059 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-25 08:50:00,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333736727] [2019-11-25 08:50:00,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:00,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333736727] [2019-11-25 08:50:00,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:00,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:00,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091433982] [2019-11-25 08:50:00,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:00,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:00,113 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-25 08:50:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,407 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-25 08:50:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:00,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-25 08:50:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,409 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:50:00,409 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:50:00,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:50:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:50:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:50:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-25 08:50:00,414 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-25 08:50:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:00,415 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-25 08:50:00,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-25 08:50:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 08:50:00,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:00,416 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:00,416 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-25 08:50:00,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819747569] [2019-11-25 08:50:00,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:00,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819747569] [2019-11-25 08:50:00,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:00,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:00,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626191118] [2019-11-25 08:50:00,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:00,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:00,498 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-25 08:50:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,783 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-25 08:50:00,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:00,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-25 08:50:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,785 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:50:00,785 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:50:00,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:50:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:50:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:50:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-25 08:50:00,790 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-25 08:50:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:00,790 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-25 08:50:00,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-25 08:50:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:50:00,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:00,795 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:00,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-25 08:50:00,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341885513] [2019-11-25 08:50:00,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341885513] [2019-11-25 08:50:00,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:00,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:00,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704936945] [2019-11-25 08:50:00,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:00,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:00,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:00,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:00,866 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-25 08:50:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:01,157 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-25 08:50:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:01,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:50:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:01,159 INFO L225 Difference]: With dead ends: 266 [2019-11-25 08:50:01,159 INFO L226 Difference]: Without dead ends: 144 [2019-11-25 08:50:01,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-25 08:50:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-25 08:50:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:50:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-25 08:50:01,164 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-25 08:50:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:01,165 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-25 08:50:01,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-25 08:50:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:50:01,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:01,166 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:01,166 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-25 08:50:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:01,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671254626] [2019-11-25 08:50:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:01,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671254626] [2019-11-25 08:50:01,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:01,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:01,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825792342] [2019-11-25 08:50:01,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:01,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:01,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:01,224 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-25 08:50:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:01,567 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-11-25 08:50:01,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:01,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:50:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:01,569 INFO L225 Difference]: With dead ends: 307 [2019-11-25 08:50:01,569 INFO L226 Difference]: Without dead ends: 185 [2019-11-25 08:50:01,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-25 08:50:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-25 08:50:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-25 08:50:01,575 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-25 08:50:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:01,575 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-25 08:50:01,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-25 08:50:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:50:01,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:01,576 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:01,576 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-25 08:50:01,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:01,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156303850] [2019-11-25 08:50:01,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:01,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156303850] [2019-11-25 08:50:01,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:01,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:01,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806652812] [2019-11-25 08:50:01,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:01,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:01,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:01,632 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-25 08:50:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:01,998 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-11-25 08:50:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:01,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:50:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:02,000 INFO L225 Difference]: With dead ends: 329 [2019-11-25 08:50:02,000 INFO L226 Difference]: Without dead ends: 185 [2019-11-25 08:50:02,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-25 08:50:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-25 08:50:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-25 08:50:02,007 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-25 08:50:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:02,007 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-25 08:50:02,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-25 08:50:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:50:02,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:02,009 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,009 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-25 08:50:02,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779760517] [2019-11-25 08:50:02,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:02,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779760517] [2019-11-25 08:50:02,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:02,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:02,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142206723] [2019-11-25 08:50:02,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:02,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:02,072 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-25 08:50:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,423 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-11-25 08:50:02,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:02,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:50:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:02,425 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:50:02,425 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:50:02,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:50:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-25 08:50:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-25 08:50:02,433 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-25 08:50:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:02,434 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-25 08:50:02,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-25 08:50:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:50:02,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:02,437 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-25 08:50:02,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107724733] [2019-11-25 08:50:02,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:02,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107724733] [2019-11-25 08:50:02,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:02,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:02,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697340852] [2019-11-25 08:50:02,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:02,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:02,528 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-25 08:50:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,889 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-11-25 08:50:02,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:02,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:50:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:02,891 INFO L225 Difference]: With dead ends: 326 [2019-11-25 08:50:02,891 INFO L226 Difference]: Without dead ends: 182 [2019-11-25 08:50:02,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-25 08:50:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-11-25 08:50:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-25 08:50:02,897 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-25 08:50:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:02,897 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-25 08:50:02,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-25 08:50:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:50:02,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:02,898 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,898 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-25 08:50:02,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958548216] [2019-11-25 08:50:02,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:02,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958548216] [2019-11-25 08:50:02,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:02,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:02,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112148570] [2019-11-25 08:50:02,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:02,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:02,945 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-25 08:50:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:03,289 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-11-25 08:50:03,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:03,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:50:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:03,291 INFO L225 Difference]: With dead ends: 325 [2019-11-25 08:50:03,291 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:50:03,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:50:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-25 08:50:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-25 08:50:03,297 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-25 08:50:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:03,297 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-25 08:50:03,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-25 08:50:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:50:03,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:03,298 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:03,298 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-25 08:50:03,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192279499] [2019-11-25 08:50:03,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:03,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192279499] [2019-11-25 08:50:03,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:03,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789216290] [2019-11-25 08:50:03,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:03,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:03,343 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-25 08:50:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:03,674 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-11-25 08:50:03,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:03,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:50:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:03,675 INFO L225 Difference]: With dead ends: 325 [2019-11-25 08:50:03,676 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:50:03,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:50:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-25 08:50:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-25 08:50:03,681 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-25 08:50:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:03,681 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-25 08:50:03,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-25 08:50:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:50:03,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:03,682 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:03,682 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-25 08:50:03,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172107115] [2019-11-25 08:50:03,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172107115] [2019-11-25 08:50:03,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:03,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:03,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101162622] [2019-11-25 08:50:03,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:03,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:03,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:03,743 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-25 08:50:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,078 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-11-25 08:50:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:04,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:50:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,080 INFO L225 Difference]: With dead ends: 325 [2019-11-25 08:50:04,080 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:50:04,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:50:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-25 08:50:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-25 08:50:04,085 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-25 08:50:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,086 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-25 08:50:04,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-25 08:50:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-25 08:50:04,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,087 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,090 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-25 08:50:04,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132985371] [2019-11-25 08:50:04,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:04,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132985371] [2019-11-25 08:50:04,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:04,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032645051] [2019-11-25 08:50:04,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:04,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:04,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:04,145 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-25 08:50:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,467 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-11-25 08:50:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:04,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-25 08:50:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,470 INFO L225 Difference]: With dead ends: 325 [2019-11-25 08:50:04,470 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:50:04,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:50:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-25 08:50:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-25 08:50:04,475 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-25 08:50:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,475 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-25 08:50:04,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-25 08:50:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-25 08:50:04,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,476 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,476 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-25 08:50:04,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795767270] [2019-11-25 08:50:04,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:04,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795767270] [2019-11-25 08:50:04,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:04,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147476858] [2019-11-25 08:50:04,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:04,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:04,555 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-25 08:50:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,848 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-11-25 08:50:04,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:04,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-25 08:50:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,850 INFO L225 Difference]: With dead ends: 315 [2019-11-25 08:50:04,850 INFO L226 Difference]: Without dead ends: 171 [2019-11-25 08:50:04,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-25 08:50:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-11-25 08:50:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:50:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-25 08:50:04,855 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-25 08:50:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,855 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-25 08:50:04,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-25 08:50:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:50:04,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,856 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,856 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-11-25 08:50:04,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431784140] [2019-11-25 08:50:04,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:04,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431784140] [2019-11-25 08:50:04,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:04,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99712585] [2019-11-25 08:50:04,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:04,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:04,929 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-25 08:50:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,447 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-25 08:50:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:05,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:50:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,449 INFO L225 Difference]: With dead ends: 403 [2019-11-25 08:50:05,449 INFO L226 Difference]: Without dead ends: 259 [2019-11-25 08:50:05,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-25 08:50:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-25 08:50:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:50:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-25 08:50:05,460 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-25 08:50:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,460 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-25 08:50:05,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-25 08:50:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:50:05,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,462 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:05,462 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,462 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-11-25 08:50:05,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617900465] [2019-11-25 08:50:05,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:05,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617900465] [2019-11-25 08:50:05,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:05,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618147542] [2019-11-25 08:50:05,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:05,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:05,527 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-25 08:50:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,850 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-11-25 08:50:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:05,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:50:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,853 INFO L225 Difference]: With dead ends: 443 [2019-11-25 08:50:05,853 INFO L226 Difference]: Without dead ends: 256 [2019-11-25 08:50:05,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-25 08:50:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-25 08:50:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:50:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-25 08:50:05,861 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-25 08:50:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,861 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-25 08:50:05,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-25 08:50:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:50:05,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,863 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:05,863 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-11-25 08:50:05,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556873208] [2019-11-25 08:50:05,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:05,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556873208] [2019-11-25 08:50:05,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:05,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272975842] [2019-11-25 08:50:05,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:05,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:05,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:05,942 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-25 08:50:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,436 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-25 08:50:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:06,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:50:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,439 INFO L225 Difference]: With dead ends: 494 [2019-11-25 08:50:06,439 INFO L226 Difference]: Without dead ends: 283 [2019-11-25 08:50:06,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-25 08:50:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-25 08:50:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:50:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-25 08:50:06,447 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-25 08:50:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,447 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-25 08:50:06,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-25 08:50:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:50:06,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,449 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:06,449 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-11-25 08:50:06,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882812493] [2019-11-25 08:50:06,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:06,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882812493] [2019-11-25 08:50:06,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:06,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212173405] [2019-11-25 08:50:06,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:06,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:06,516 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-25 08:50:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,900 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-11-25 08:50:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:06,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:50:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,903 INFO L225 Difference]: With dead ends: 467 [2019-11-25 08:50:06,903 INFO L226 Difference]: Without dead ends: 256 [2019-11-25 08:50:06,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-25 08:50:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-25 08:50:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:50:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-25 08:50:06,908 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-25 08:50:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,909 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-25 08:50:06,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-25 08:50:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:06,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,910 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:06,910 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-11-25 08:50:06,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247560614] [2019-11-25 08:50:06,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:06,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247560614] [2019-11-25 08:50:06,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:06,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930716953] [2019-11-25 08:50:06,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:06,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:06,973 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-25 08:50:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,454 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-25 08:50:07,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:07,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,457 INFO L225 Difference]: With dead ends: 493 [2019-11-25 08:50:07,457 INFO L226 Difference]: Without dead ends: 282 [2019-11-25 08:50:07,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-25 08:50:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-25 08:50:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:50:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-25 08:50:07,463 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-25 08:50:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,463 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-25 08:50:07,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-25 08:50:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:07,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:07,464 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:07,464 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-11-25 08:50:07,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:07,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871162971] [2019-11-25 08:50:07,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:07,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871162971] [2019-11-25 08:50:07,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:07,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:07,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031983376] [2019-11-25 08:50:07,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:07,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:07,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:07,526 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-25 08:50:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:08,005 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-25 08:50:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:08,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:08,007 INFO L225 Difference]: With dead ends: 491 [2019-11-25 08:50:08,007 INFO L226 Difference]: Without dead ends: 280 [2019-11-25 08:50:08,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-25 08:50:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-25 08:50:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:50:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-25 08:50:08,016 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-25 08:50:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,017 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-25 08:50:08,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-25 08:50:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:08,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,018 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:08,018 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-11-25 08:50:08,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387129682] [2019-11-25 08:50:08,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:08,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387129682] [2019-11-25 08:50:08,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:08,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916986230] [2019-11-25 08:50:08,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:08,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:08,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:08,092 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-25 08:50:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:08,564 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-25 08:50:08,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:08,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:08,566 INFO L225 Difference]: With dead ends: 490 [2019-11-25 08:50:08,566 INFO L226 Difference]: Without dead ends: 279 [2019-11-25 08:50:08,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-25 08:50:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-25 08:50:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:50:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-25 08:50:08,573 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-25 08:50:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,573 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-25 08:50:08,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-25 08:50:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:08,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,574 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:08,575 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-11-25 08:50:08,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476381332] [2019-11-25 08:50:08,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:50:08,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476381332] [2019-11-25 08:50:08,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:08,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194065693] [2019-11-25 08:50:08,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:08,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:08,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:08,657 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-25 08:50:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,202 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-25 08:50:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:09,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-25 08:50:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,204 INFO L225 Difference]: With dead ends: 462 [2019-11-25 08:50:09,204 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:50:09,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:50:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-25 08:50:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-25 08:50:09,211 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-25 08:50:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,211 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-25 08:50:09,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-25 08:50:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:09,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,212 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,213 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-11-25 08:50:09,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620331191] [2019-11-25 08:50:09,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:09,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620331191] [2019-11-25 08:50:09,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:09,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596050745] [2019-11-25 08:50:09,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:09,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:09,272 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-25 08:50:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,566 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-11-25 08:50:09,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:09,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,568 INFO L225 Difference]: With dead ends: 504 [2019-11-25 08:50:09,568 INFO L226 Difference]: Without dead ends: 273 [2019-11-25 08:50:09,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-25 08:50:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-11-25 08:50:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-25 08:50:09,598 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-25 08:50:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,598 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-25 08:50:09,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-25 08:50:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:09,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,599 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-11-25 08:50:09,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678186088] [2019-11-25 08:50:09,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:09,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678186088] [2019-11-25 08:50:09,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:09,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134446453] [2019-11-25 08:50:09,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:09,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:09,659 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-25 08:50:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,032 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-11-25 08:50:10,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:10,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,034 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:50:10,034 INFO L226 Difference]: Without dead ends: 272 [2019-11-25 08:50:10,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-25 08:50:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-25 08:50:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-25 08:50:10,041 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-25 08:50:10,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,042 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-25 08:50:10,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-25 08:50:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:50:10,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,043 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,043 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-11-25 08:50:10,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494429029] [2019-11-25 08:50:10,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:10,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494429029] [2019-11-25 08:50:10,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:10,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467822464] [2019-11-25 08:50:10,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:10,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:10,098 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-25 08:50:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,465 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-25 08:50:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:10,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:50:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,467 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:50:10,468 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:50:10,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:50:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-25 08:50:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-25 08:50:10,477 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-25 08:50:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,477 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-25 08:50:10,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-25 08:50:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:50:10,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,479 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,479 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-11-25 08:50:10,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210697709] [2019-11-25 08:50:10,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:10,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210697709] [2019-11-25 08:50:10,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:10,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112710596] [2019-11-25 08:50:10,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:10,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:10,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:10,533 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-25 08:50:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,818 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-11-25 08:50:10,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:10,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:50:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,820 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:50:10,821 INFO L226 Difference]: Without dead ends: 272 [2019-11-25 08:50:10,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-25 08:50:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-25 08:50:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-25 08:50:10,828 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-25 08:50:10,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,828 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-25 08:50:10,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-25 08:50:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:50:10,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,829 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,830 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,830 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-11-25 08:50:10,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005130998] [2019-11-25 08:50:10,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:10,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005130998] [2019-11-25 08:50:10,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:10,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121430020] [2019-11-25 08:50:10,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:10,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:10,887 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-25 08:50:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,240 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-25 08:50:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:11,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:50:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,242 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:50:11,242 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:50:11,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:50:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-25 08:50:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-25 08:50:11,250 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-25 08:50:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,250 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-25 08:50:11,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-25 08:50:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:50:11,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,252 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,252 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-11-25 08:50:11,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213160718] [2019-11-25 08:50:11,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:11,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213160718] [2019-11-25 08:50:11,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813230256] [2019-11-25 08:50:11,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,310 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-25 08:50:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,670 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-11-25 08:50:11,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:11,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:50:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,672 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:50:11,672 INFO L226 Difference]: Without dead ends: 272 [2019-11-25 08:50:11,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-25 08:50:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-25 08:50:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-25 08:50:11,679 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-25 08:50:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,680 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-25 08:50:11,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-25 08:50:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:50:11,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,682 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,682 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,683 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-11-25 08:50:11,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972988500] [2019-11-25 08:50:11,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:11,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972988500] [2019-11-25 08:50:11,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523432215] [2019-11-25 08:50:11,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,737 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-25 08:50:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,228 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-25 08:50:12,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:12,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:50:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,230 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:50:12,230 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:50:12,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:50:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-25 08:50:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-25 08:50:12,238 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-25 08:50:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,238 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-25 08:50:12,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-25 08:50:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:50:12,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,239 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:12,239 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-11-25 08:50:12,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152592212] [2019-11-25 08:50:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:12,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152592212] [2019-11-25 08:50:12,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:12,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339164987] [2019-11-25 08:50:12,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:12,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:12,300 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-25 08:50:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,637 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-11-25 08:50:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:12,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:50:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,639 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:50:12,639 INFO L226 Difference]: Without dead ends: 272 [2019-11-25 08:50:12,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-25 08:50:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-25 08:50:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-25 08:50:12,647 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-25 08:50:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,647 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-25 08:50:12,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-25 08:50:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:50:12,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,649 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:12,649 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-11-25 08:50:12,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919987275] [2019-11-25 08:50:12,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:12,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919987275] [2019-11-25 08:50:12,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:12,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688036261] [2019-11-25 08:50:12,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:12,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:12,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:12,706 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-25 08:50:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,129 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-25 08:50:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:13,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:50:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,131 INFO L225 Difference]: With dead ends: 520 [2019-11-25 08:50:13,131 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:50:13,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:50:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-25 08:50:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-25 08:50:13,141 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-25 08:50:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,141 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-25 08:50:13,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-25 08:50:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:50:13,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,142 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,143 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-11-25 08:50:13,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190038416] [2019-11-25 08:50:13,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:13,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190038416] [2019-11-25 08:50:13,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:13,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637032511] [2019-11-25 08:50:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:13,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:13,240 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-25 08:50:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,512 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-11-25 08:50:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:13,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:50:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,513 INFO L225 Difference]: With dead ends: 493 [2019-11-25 08:50:13,513 INFO L226 Difference]: Without dead ends: 262 [2019-11-25 08:50:13,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-25 08:50:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-11-25 08:50:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-25 08:50:13,520 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-25 08:50:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,520 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-25 08:50:13,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-25 08:50:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:50:13,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,521 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,521 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-11-25 08:50:13,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91348239] [2019-11-25 08:50:13,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:13,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91348239] [2019-11-25 08:50:13,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:13,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320633651] [2019-11-25 08:50:13,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:13,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:13,583 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-25 08:50:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,928 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-25 08:50:13,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:13,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-25 08:50:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,930 INFO L225 Difference]: With dead ends: 520 [2019-11-25 08:50:13,930 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:50:13,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:50:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-25 08:50:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:50:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-25 08:50:13,939 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-25 08:50:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,939 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-25 08:50:13,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-25 08:50:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:50:13,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,940 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,940 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-11-25 08:50:13,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574694254] [2019-11-25 08:50:13,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:50:14,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574694254] [2019-11-25 08:50:14,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138828426] [2019-11-25 08:50:14,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,004 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-25 08:50:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,039 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-25 08:50:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:50:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,042 INFO L225 Difference]: With dead ends: 710 [2019-11-25 08:50:14,042 INFO L226 Difference]: Without dead ends: 479 [2019-11-25 08:50:14,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-25 08:50:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-25 08:50:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-25 08:50:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-25 08:50:14,056 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-25 08:50:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,056 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-25 08:50:14,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-25 08:50:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-25 08:50:14,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,058 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,058 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-25 08:50:14,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134503267] [2019-11-25 08:50:14,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:14,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:14,308 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:50:14,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:14 BoogieIcfgContainer [2019-11-25 08:50:14,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:14,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:14,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:14,457 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:14,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:56" (3/4) ... [2019-11-25 08:50:14,461 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:50:14,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:14,463 INFO L168 Benchmark]: Toolchain (without parser) took 20058.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 398.5 MB). Free memory was 939.2 MB in the beginning and 1.2 GB in the end (delta: -215.5 MB). Peak memory consumption was 183.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,463 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:14,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:14,464 INFO L168 Benchmark]: Boogie Preprocessor took 107.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,464 INFO L168 Benchmark]: RCFGBuilder took 1297.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,465 INFO L168 Benchmark]: TraceAbstraction took 17843.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.7 MB). Free memory was 995.8 MB in the beginning and 1.2 GB in the end (delta: -158.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,465 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:14,467 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1297.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17843.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.7 MB). Free memory was 995.8 MB in the beginning and 1.2 GB in the end (delta: -158.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.7s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7109 SDtfs, 2139 SDslu, 10637 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 941 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:50:16,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:16,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:16,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:16,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:16,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:16,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:16,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:16,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:16,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:16,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:16,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:16,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:16,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:16,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:16,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:16,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:16,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:16,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:16,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:16,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:16,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:16,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:16,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:16,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:16,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:16,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:16,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:16,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:16,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:16,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:16,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:16,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:16,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:16,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:16,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:16,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:16,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:16,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:16,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:16,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:16,405 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:50:16,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:16,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:16,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:16,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:16,433 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:16,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:16,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:16,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:16,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:16,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:16,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:16,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:16,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:50:16,435 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:50:16,435 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:50:16,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:16,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:16,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:16,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:16,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:16,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:16,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:16,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:16,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:16,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:16,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:16,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:16,438 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:50:16,438 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:50:16,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:16,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:50:16,439 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_801849cc-b503-4f68-94bd-94883a2adf31/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-25 08:50:16,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:16,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:16,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:16,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:16,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:16,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-25 08:50:16,806 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/ed439dc20/0e0b5c44f04f4e4daae60205ba7b6227/FLAGbc3f344cc [2019-11-25 08:50:17,307 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:17,307 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-25 08:50:17,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/ed439dc20/0e0b5c44f04f4e4daae60205ba7b6227/FLAGbc3f344cc [2019-11-25 08:50:17,532 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_801849cc-b503-4f68-94bd-94883a2adf31/bin/uautomizer/data/ed439dc20/0e0b5c44f04f4e4daae60205ba7b6227 [2019-11-25 08:50:17,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:17,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:17,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:17,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:17,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:17,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a5f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17, skipping insertion in model container [2019-11-25 08:50:17,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:17,630 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:17,930 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:50:17,930 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:50:17,931 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:50:18,081 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:50:18,094 INFO L168 Benchmark]: Toolchain (without parser) took 557.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:18,095 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:18,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:18,098 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...