./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/s3.i --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_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/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 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/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 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f .............................................................................................................................................................. 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:52:17,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:17,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:17,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:17,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:17,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:17,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:17,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:17,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:17,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:17,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:17,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:17,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:17,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:17,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:17,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:17,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:17,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:17,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:17,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:17,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:17,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:17,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:17,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:17,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:17,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:17,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:17,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:17,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:17,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:17,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:17,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:17,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:17,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:17,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:17,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:17,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:17,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:17,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:17,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:17,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:17,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:17,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:17,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:17,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:17,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:17,887 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:17,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:17,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:17,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:17,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:17,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:17,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:17,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:17,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:17,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:17,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:17,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:17,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:17,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:17,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:17,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:17,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:17,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:17,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:17,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:17,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:17,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:17,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:17,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:17,893 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_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/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 -> 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f [2019-11-25 08:52:18,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:18,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:18,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:18,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:18,099 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:18,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/../../sv-benchmarks/c/loops/s3.i [2019-11-25 08:52:18,157 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/0a0312c28/6e415f6a5f304b31974336f021756f32/FLAG97eee71e3 [2019-11-25 08:52:18,710 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:18,711 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/sv-benchmarks/c/loops/s3.i [2019-11-25 08:52:18,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/0a0312c28/6e415f6a5f304b31974336f021756f32/FLAG97eee71e3 [2019-11-25 08:52:18,964 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/0a0312c28/6e415f6a5f304b31974336f021756f32 [2019-11-25 08:52:18,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:18,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:18,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:18,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:18,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:18,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:18" (1/1) ... [2019-11-25 08:52:18,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a60956a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:18, skipping insertion in model container [2019-11-25 08:52:18,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:18" (1/1) ... [2019-11-25 08:52:18,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:19,030 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:19,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:19,520 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:19,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:19,669 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:19,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19 WrapperNode [2019-11-25 08:52:19,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:19,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:19,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:19,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:19,679 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:52:19" (1/1) ... [2019-11-25 08:52:19,701 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:52:19" (1/1) ... [2019-11-25 08:52:19,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:19,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:19,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:19,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:19,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... [2019-11-25 08:52:19,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:19,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:19,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:19,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:19,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/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:52:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:52:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:52:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:52:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:52:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:52:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:52:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:19,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:20,165 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:52:21,112 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:52:21,112 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:52:21,113 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:21,114 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:52:21,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:21 BoogieIcfgContainer [2019-11-25 08:52:21,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:21,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:21,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:21,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:21,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:18" (1/3) ... [2019-11-25 08:52:21,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10253fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:21, skipping insertion in model container [2019-11-25 08:52:21,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:19" (2/3) ... [2019-11-25 08:52:21,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10253fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:21, skipping insertion in model container [2019-11-25 08:52:21,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:21" (3/3) ... [2019-11-25 08:52:21,130 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-11-25 08:52:21,139 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:21,148 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:21,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:21,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:21,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:21,225 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:21,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:21,226 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:21,226 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:21,226 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:21,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-25 08:52:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:52:21,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:21,268 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] [2019-11-25 08:52:21,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-11-25 08:52:21,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:21,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110572786] [2019-11-25 08:52:21,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:21,587 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:52:21,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110572786] [2019-11-25 08:52:21,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:21,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:21,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601853877] [2019-11-25 08:52:21,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:21,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:21,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:21,610 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-11-25 08:52:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:21,717 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-11-25 08:52:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:21,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:52:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:21,731 INFO L225 Difference]: With dead ends: 375 [2019-11-25 08:52:21,731 INFO L226 Difference]: Without dead ends: 217 [2019-11-25 08:52:21,735 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:52:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-25 08:52:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-11-25 08:52:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-25 08:52:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2019-11-25 08:52:21,828 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2019-11-25 08:52:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:21,829 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2019-11-25 08:52:21,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2019-11-25 08:52:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:52:21,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:21,832 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] [2019-11-25 08:52:21,832 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2019-11-25 08:52:21,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:21,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008692367] [2019-11-25 08:52:21,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:22,018 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:52:22,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008692367] [2019-11-25 08:52:22,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:22,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:22,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747512107] [2019-11-25 08:52:22,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:22,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:22,022 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 4 states. [2019-11-25 08:52:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:22,528 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2019-11-25 08:52:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:22,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-25 08:52:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:22,532 INFO L225 Difference]: With dead ends: 359 [2019-11-25 08:52:22,532 INFO L226 Difference]: Without dead ends: 252 [2019-11-25 08:52:22,534 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:52:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-25 08:52:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2019-11-25 08:52:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-25 08:52:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 351 transitions. [2019-11-25 08:52:22,563 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 351 transitions. Word has length 39 [2019-11-25 08:52:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:22,563 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 351 transitions. [2019-11-25 08:52:22,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 351 transitions. [2019-11-25 08:52:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-25 08:52:22,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:22,572 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:22,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:22,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1468155038, now seen corresponding path program 1 times [2019-11-25 08:52:22,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:22,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167023557] [2019-11-25 08:52:22,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:22,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167023557] [2019-11-25 08:52:22,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:22,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:22,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275567179] [2019-11-25 08:52:22,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:22,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:22,700 INFO L87 Difference]: Start difference. First operand 235 states and 351 transitions. Second operand 4 states. [2019-11-25 08:52:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:23,100 INFO L93 Difference]: Finished difference Result 376 states and 562 transitions. [2019-11-25 08:52:23,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:23,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-25 08:52:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:23,103 INFO L225 Difference]: With dead ends: 376 [2019-11-25 08:52:23,103 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:52:23,104 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:52:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:52:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-11-25 08:52:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-25 08:52:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2019-11-25 08:52:23,123 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 54 [2019-11-25 08:52:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:23,124 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2019-11-25 08:52:23,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2019-11-25 08:52:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-25 08:52:23,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:23,127 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:23,127 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:23,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1486810496, now seen corresponding path program 1 times [2019-11-25 08:52:23,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:23,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865864580] [2019-11-25 08:52:23,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:23,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865864580] [2019-11-25 08:52:23,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:23,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:23,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123897678] [2019-11-25 08:52:23,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:23,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:23,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:23,267 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 4 states. [2019-11-25 08:52:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:23,641 INFO L93 Difference]: Finished difference Result 376 states and 560 transitions. [2019-11-25 08:52:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:23,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-25 08:52:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:23,644 INFO L225 Difference]: With dead ends: 376 [2019-11-25 08:52:23,644 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:52:23,646 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:52:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:52:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-11-25 08:52:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-25 08:52:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 349 transitions. [2019-11-25 08:52:23,662 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 349 transitions. Word has length 54 [2019-11-25 08:52:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:23,664 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 349 transitions. [2019-11-25 08:52:23,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 349 transitions. [2019-11-25 08:52:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:52:23,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:23,673 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:23,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:23,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1014296481, now seen corresponding path program 1 times [2019-11-25 08:52:23,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531346491] [2019-11-25 08:52:23,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:23,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531346491] [2019-11-25 08:52:23,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:23,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:23,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396938959] [2019-11-25 08:52:23,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:23,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:23,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:23,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:23,763 INFO L87 Difference]: Start difference. First operand 235 states and 349 transitions. Second operand 4 states. [2019-11-25 08:52:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:24,212 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2019-11-25 08:52:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:24,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-25 08:52:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:24,216 INFO L225 Difference]: With dead ends: 376 [2019-11-25 08:52:24,217 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:52:24,217 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:52:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:52:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-11-25 08:52:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-25 08:52:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 348 transitions. [2019-11-25 08:52:24,227 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 348 transitions. Word has length 55 [2019-11-25 08:52:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:24,227 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 348 transitions. [2019-11-25 08:52:24,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 348 transitions. [2019-11-25 08:52:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:24,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:24,229 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:24,229 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1792231515, now seen corresponding path program 1 times [2019-11-25 08:52:24,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:24,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537459627] [2019-11-25 08:52:24,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:24,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537459627] [2019-11-25 08:52:24,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:24,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:24,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794712052] [2019-11-25 08:52:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:24,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:24,315 INFO L87 Difference]: Start difference. First operand 235 states and 348 transitions. Second operand 4 states. [2019-11-25 08:52:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:24,705 INFO L93 Difference]: Finished difference Result 376 states and 556 transitions. [2019-11-25 08:52:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:24,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-25 08:52:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:24,708 INFO L225 Difference]: With dead ends: 376 [2019-11-25 08:52:24,708 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:52:24,709 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:52:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:52:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-11-25 08:52:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-25 08:52:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 347 transitions. [2019-11-25 08:52:24,717 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 347 transitions. Word has length 56 [2019-11-25 08:52:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:24,720 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 347 transitions. [2019-11-25 08:52:24,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 347 transitions. [2019-11-25 08:52:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:52:24,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:24,721 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:24,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:24,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:24,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1615585892, now seen corresponding path program 1 times [2019-11-25 08:52:24,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:24,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180740843] [2019-11-25 08:52:24,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:24,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180740843] [2019-11-25 08:52:24,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:24,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:24,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965931071] [2019-11-25 08:52:24,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:24,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:24,798 INFO L87 Difference]: Start difference. First operand 235 states and 347 transitions. Second operand 4 states. [2019-11-25 08:52:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:25,103 INFO L93 Difference]: Finished difference Result 367 states and 543 transitions. [2019-11-25 08:52:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:25,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-25 08:52:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:25,106 INFO L225 Difference]: With dead ends: 367 [2019-11-25 08:52:25,106 INFO L226 Difference]: Without dead ends: 242 [2019-11-25 08:52:25,107 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:52:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-25 08:52:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235. [2019-11-25 08:52:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-25 08:52:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2019-11-25 08:52:25,118 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 57 [2019-11-25 08:52:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:25,119 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2019-11-25 08:52:25,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2019-11-25 08:52:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:52:25,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:25,120 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:25,120 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2019-11-25 08:52:25,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:25,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276495400] [2019-11-25 08:52:25,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:52:25,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276495400] [2019-11-25 08:52:25,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:25,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:25,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463130745] [2019-11-25 08:52:25,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:25,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:25,188 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand 3 states. [2019-11-25 08:52:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:25,230 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2019-11-25 08:52:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:25,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-25 08:52:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:25,233 INFO L225 Difference]: With dead ends: 483 [2019-11-25 08:52:25,233 INFO L226 Difference]: Without dead ends: 358 [2019-11-25 08:52:25,234 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:52:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-25 08:52:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-11-25 08:52:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-25 08:52:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2019-11-25 08:52:25,246 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 57 [2019-11-25 08:52:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:25,246 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2019-11-25 08:52:25,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2019-11-25 08:52:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:52:25,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:25,248 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:52:25,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2019-11-25 08:52:25,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:25,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371448551] [2019-11-25 08:52:25,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:52:25,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371448551] [2019-11-25 08:52:25,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:25,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:25,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817999747] [2019-11-25 08:52:25,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:25,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:25,323 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand 4 states. [2019-11-25 08:52:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:25,863 INFO L93 Difference]: Finished difference Result 989 states and 1463 transitions. [2019-11-25 08:52:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:25,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:52:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:25,870 INFO L225 Difference]: With dead ends: 989 [2019-11-25 08:52:25,870 INFO L226 Difference]: Without dead ends: 638 [2019-11-25 08:52:25,871 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:52:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-25 08:52:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 421. [2019-11-25 08:52:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-25 08:52:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-11-25 08:52:25,888 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 77 [2019-11-25 08:52:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:25,889 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-11-25 08:52:25,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-11-25 08:52:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:52:25,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:25,893 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:52:25,893 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash -126791679, now seen corresponding path program 1 times [2019-11-25 08:52:25,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:25,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780270161] [2019-11-25 08:52:25,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:25,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780270161] [2019-11-25 08:52:25,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:25,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:25,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190063344] [2019-11-25 08:52:25,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:25,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:25,968 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-11-25 08:52:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:26,342 INFO L93 Difference]: Finished difference Result 975 states and 1463 transitions. [2019-11-25 08:52:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:26,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:52:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:26,347 INFO L225 Difference]: With dead ends: 975 [2019-11-25 08:52:26,347 INFO L226 Difference]: Without dead ends: 561 [2019-11-25 08:52:26,348 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:52:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-11-25 08:52:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 487. [2019-11-25 08:52:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 746 transitions. [2019-11-25 08:52:26,363 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 746 transitions. Word has length 77 [2019-11-25 08:52:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:26,363 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 746 transitions. [2019-11-25 08:52:26,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 746 transitions. [2019-11-25 08:52:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:52:26,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:26,368 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:26,368 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash 416305772, now seen corresponding path program 1 times [2019-11-25 08:52:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:26,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286313398] [2019-11-25 08:52:26,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:26,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286313398] [2019-11-25 08:52:26,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:26,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:26,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000756202] [2019-11-25 08:52:26,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:26,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:26,441 INFO L87 Difference]: Start difference. First operand 487 states and 746 transitions. Second operand 4 states. [2019-11-25 08:52:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:26,812 INFO L93 Difference]: Finished difference Result 1038 states and 1571 transitions. [2019-11-25 08:52:26,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:26,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-25 08:52:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:26,816 INFO L225 Difference]: With dead ends: 1038 [2019-11-25 08:52:26,816 INFO L226 Difference]: Without dead ends: 558 [2019-11-25 08:52:26,817 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:52:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-25 08:52:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-11-25 08:52:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 743 transitions. [2019-11-25 08:52:26,832 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 743 transitions. Word has length 92 [2019-11-25 08:52:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:26,833 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 743 transitions. [2019-11-25 08:52:26,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 743 transitions. [2019-11-25 08:52:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:52:26,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:26,835 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:26,835 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 397650314, now seen corresponding path program 1 times [2019-11-25 08:52:26,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:26,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211072973] [2019-11-25 08:52:26,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:26,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211072973] [2019-11-25 08:52:26,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:26,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:26,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241424207] [2019-11-25 08:52:26,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:26,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:26,899 INFO L87 Difference]: Start difference. First operand 487 states and 743 transitions. Second operand 4 states. [2019-11-25 08:52:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:27,260 INFO L93 Difference]: Finished difference Result 1038 states and 1565 transitions. [2019-11-25 08:52:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:27,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-25 08:52:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:27,264 INFO L225 Difference]: With dead ends: 1038 [2019-11-25 08:52:27,265 INFO L226 Difference]: Without dead ends: 558 [2019-11-25 08:52:27,266 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:52:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-25 08:52:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-11-25 08:52:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 740 transitions. [2019-11-25 08:52:27,283 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 740 transitions. Word has length 92 [2019-11-25 08:52:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:27,284 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 740 transitions. [2019-11-25 08:52:27,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 740 transitions. [2019-11-25 08:52:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-25 08:52:27,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:27,286 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:27,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:27,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1569413781, now seen corresponding path program 1 times [2019-11-25 08:52:27,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:27,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757765678] [2019-11-25 08:52:27,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:27,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757765678] [2019-11-25 08:52:27,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:27,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:27,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982687613] [2019-11-25 08:52:27,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:27,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:27,386 INFO L87 Difference]: Start difference. First operand 487 states and 740 transitions. Second operand 4 states. [2019-11-25 08:52:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:27,736 INFO L93 Difference]: Finished difference Result 1038 states and 1559 transitions. [2019-11-25 08:52:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:27,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-25 08:52:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:27,747 INFO L225 Difference]: With dead ends: 1038 [2019-11-25 08:52:27,747 INFO L226 Difference]: Without dead ends: 558 [2019-11-25 08:52:27,748 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:52:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-25 08:52:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-11-25 08:52:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 737 transitions. [2019-11-25 08:52:27,763 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 737 transitions. Word has length 93 [2019-11-25 08:52:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:27,763 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 737 transitions. [2019-11-25 08:52:27,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 737 transitions. [2019-11-25 08:52:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 08:52:27,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:27,765 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:27,765 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 993375279, now seen corresponding path program 1 times [2019-11-25 08:52:27,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:27,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350939793] [2019-11-25 08:52:27,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:27,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350939793] [2019-11-25 08:52:27,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:27,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:27,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317569817] [2019-11-25 08:52:27,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:27,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:27,841 INFO L87 Difference]: Start difference. First operand 487 states and 737 transitions. Second operand 4 states. [2019-11-25 08:52:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:28,210 INFO L93 Difference]: Finished difference Result 1038 states and 1553 transitions. [2019-11-25 08:52:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:28,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-25 08:52:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:28,215 INFO L225 Difference]: With dead ends: 1038 [2019-11-25 08:52:28,215 INFO L226 Difference]: Without dead ends: 558 [2019-11-25 08:52:28,216 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:52:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-25 08:52:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-11-25 08:52:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 734 transitions. [2019-11-25 08:52:28,231 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 734 transitions. Word has length 94 [2019-11-25 08:52:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:28,231 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 734 transitions. [2019-11-25 08:52:28,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 734 transitions. [2019-11-25 08:52:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-25 08:52:28,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:28,233 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:28,233 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2070050586, now seen corresponding path program 1 times [2019-11-25 08:52:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337978220] [2019-11-25 08:52:28,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:28,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337978220] [2019-11-25 08:52:28,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:28,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:28,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970259066] [2019-11-25 08:52:28,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:28,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:28,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:28,296 INFO L87 Difference]: Start difference. First operand 487 states and 734 transitions. Second operand 4 states. [2019-11-25 08:52:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:28,692 INFO L93 Difference]: Finished difference Result 1011 states and 1514 transitions. [2019-11-25 08:52:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:28,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-25 08:52:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:28,696 INFO L225 Difference]: With dead ends: 1011 [2019-11-25 08:52:28,696 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:52:28,697 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:52:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:52:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-11-25 08:52:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 731 transitions. [2019-11-25 08:52:28,716 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 731 transitions. Word has length 95 [2019-11-25 08:52:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:28,716 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 731 transitions. [2019-11-25 08:52:28,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 731 transitions. [2019-11-25 08:52:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-25 08:52:28,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:28,718 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-25 08:52:28,718 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2066779273, now seen corresponding path program 1 times [2019-11-25 08:52:28,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:28,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343501224] [2019-11-25 08:52:28,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:28,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343501224] [2019-11-25 08:52:28,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:28,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:28,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864543242] [2019-11-25 08:52:28,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:28,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:28,792 INFO L87 Difference]: Start difference. First operand 487 states and 731 transitions. Second operand 4 states. [2019-11-25 08:52:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:29,139 INFO L93 Difference]: Finished difference Result 1011 states and 1508 transitions. [2019-11-25 08:52:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:29,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-25 08:52:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:29,143 INFO L225 Difference]: With dead ends: 1011 [2019-11-25 08:52:29,143 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:52:29,144 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:52:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:52:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-11-25 08:52:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 728 transitions. [2019-11-25 08:52:29,159 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 728 transitions. Word has length 95 [2019-11-25 08:52:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:29,159 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 728 transitions. [2019-11-25 08:52:29,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 728 transitions. [2019-11-25 08:52:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 08:52:29,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:29,161 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-25 08:52:29,162 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 952822956, now seen corresponding path program 1 times [2019-11-25 08:52:29,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:29,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503930717] [2019-11-25 08:52:29,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:29,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503930717] [2019-11-25 08:52:29,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:29,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:29,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810166697] [2019-11-25 08:52:29,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:29,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:29,227 INFO L87 Difference]: Start difference. First operand 487 states and 728 transitions. Second operand 4 states. [2019-11-25 08:52:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:29,538 INFO L93 Difference]: Finished difference Result 999 states and 1485 transitions. [2019-11-25 08:52:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:29,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-25 08:52:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:29,542 INFO L225 Difference]: With dead ends: 999 [2019-11-25 08:52:29,542 INFO L226 Difference]: Without dead ends: 519 [2019-11-25 08:52:29,543 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:52:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-11-25 08:52:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2019-11-25 08:52:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 725 transitions. [2019-11-25 08:52:29,562 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 725 transitions. Word has length 96 [2019-11-25 08:52:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:29,562 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 725 transitions. [2019-11-25 08:52:29,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 725 transitions. [2019-11-25 08:52:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:29,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:29,564 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:29,564 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2019-11-25 08:52:29,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:29,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690866267] [2019-11-25 08:52:29,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:29,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690866267] [2019-11-25 08:52:29,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:29,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:29,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19900254] [2019-11-25 08:52:29,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:29,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:29,632 INFO L87 Difference]: Start difference. First operand 487 states and 725 transitions. Second operand 3 states. [2019-11-25 08:52:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:29,701 INFO L93 Difference]: Finished difference Result 986 states and 1470 transitions. [2019-11-25 08:52:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:29,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:52:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:29,706 INFO L225 Difference]: With dead ends: 986 [2019-11-25 08:52:29,706 INFO L226 Difference]: Without dead ends: 652 [2019-11-25 08:52:29,707 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:52:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-11-25 08:52:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-11-25 08:52:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-25 08:52:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 965 transitions. [2019-11-25 08:52:29,724 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 965 transitions. Word has length 98 [2019-11-25 08:52:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:29,725 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 965 transitions. [2019-11-25 08:52:29,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 965 transitions. [2019-11-25 08:52:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:29,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:29,727 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:29,727 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2019-11-25 08:52:29,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:29,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252957999] [2019-11-25 08:52:29,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-25 08:52:29,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252957999] [2019-11-25 08:52:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:29,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806859863] [2019-11-25 08:52:29,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:29,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:29,791 INFO L87 Difference]: Start difference. First operand 650 states and 965 transitions. Second operand 3 states. [2019-11-25 08:52:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:29,876 INFO L93 Difference]: Finished difference Result 1145 states and 1701 transitions. [2019-11-25 08:52:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:29,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:52:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:29,881 INFO L225 Difference]: With dead ends: 1145 [2019-11-25 08:52:29,881 INFO L226 Difference]: Without dead ends: 648 [2019-11-25 08:52:29,882 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:52:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-25 08:52:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-11-25 08:52:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-25 08:52:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 957 transitions. [2019-11-25 08:52:29,901 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 957 transitions. Word has length 98 [2019-11-25 08:52:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:29,901 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 957 transitions. [2019-11-25 08:52:29,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 957 transitions. [2019-11-25 08:52:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:52:29,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:29,903 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:29,903 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2019-11-25 08:52:29,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:29,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381948871] [2019-11-25 08:52:29,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:29,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381948871] [2019-11-25 08:52:29,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:29,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:29,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114435537] [2019-11-25 08:52:29,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:29,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:29,978 INFO L87 Difference]: Start difference. First operand 648 states and 957 transitions. Second operand 4 states. [2019-11-25 08:52:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:30,376 INFO L93 Difference]: Finished difference Result 1446 states and 2132 transitions. [2019-11-25 08:52:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:30,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:52:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:30,382 INFO L225 Difference]: With dead ends: 1446 [2019-11-25 08:52:30,382 INFO L226 Difference]: Without dead ends: 805 [2019-11-25 08:52:30,383 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:52:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-25 08:52:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 720. [2019-11-25 08:52:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1083 transitions. [2019-11-25 08:52:30,410 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1083 transitions. Word has length 100 [2019-11-25 08:52:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:30,411 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1083 transitions. [2019-11-25 08:52:30,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1083 transitions. [2019-11-25 08:52:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-25 08:52:30,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:30,415 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:30,415 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2019-11-25 08:52:30,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:30,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567009445] [2019-11-25 08:52:30,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:30,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567009445] [2019-11-25 08:52:30,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:30,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:30,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704700144] [2019-11-25 08:52:30,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:30,549 INFO L87 Difference]: Start difference. First operand 720 states and 1083 transitions. Second operand 4 states. [2019-11-25 08:52:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:30,939 INFO L93 Difference]: Finished difference Result 1515 states and 2252 transitions. [2019-11-25 08:52:30,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:30,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-25 08:52:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:30,944 INFO L225 Difference]: With dead ends: 1515 [2019-11-25 08:52:30,944 INFO L226 Difference]: Without dead ends: 802 [2019-11-25 08:52:30,948 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:52:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-11-25 08:52:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-11-25 08:52:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1080 transitions. [2019-11-25 08:52:30,968 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1080 transitions. Word has length 115 [2019-11-25 08:52:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:30,968 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1080 transitions. [2019-11-25 08:52:30,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1080 transitions. [2019-11-25 08:52:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-25 08:52:30,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:30,970 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:30,971 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2019-11-25 08:52:30,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:30,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151233349] [2019-11-25 08:52:30,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:31,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151233349] [2019-11-25 08:52:31,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172594477] [2019-11-25 08:52:31,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,046 INFO L87 Difference]: Start difference. First operand 720 states and 1080 transitions. Second operand 4 states. [2019-11-25 08:52:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:31,411 INFO L93 Difference]: Finished difference Result 1515 states and 2246 transitions. [2019-11-25 08:52:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:31,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-25 08:52:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:31,417 INFO L225 Difference]: With dead ends: 1515 [2019-11-25 08:52:31,417 INFO L226 Difference]: Without dead ends: 802 [2019-11-25 08:52:31,418 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:52:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-11-25 08:52:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-11-25 08:52:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1077 transitions. [2019-11-25 08:52:31,438 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1077 transitions. Word has length 115 [2019-11-25 08:52:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:31,439 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1077 transitions. [2019-11-25 08:52:31,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1077 transitions. [2019-11-25 08:52:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:52:31,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:31,441 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:31,441 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2019-11-25 08:52:31,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:31,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110682320] [2019-11-25 08:52:31,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:31,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110682320] [2019-11-25 08:52:31,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102337189] [2019-11-25 08:52:31,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,507 INFO L87 Difference]: Start difference. First operand 720 states and 1077 transitions. Second operand 4 states. [2019-11-25 08:52:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:31,856 INFO L93 Difference]: Finished difference Result 1515 states and 2240 transitions. [2019-11-25 08:52:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:31,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-25 08:52:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:31,861 INFO L225 Difference]: With dead ends: 1515 [2019-11-25 08:52:31,861 INFO L226 Difference]: Without dead ends: 802 [2019-11-25 08:52:31,862 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:52:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-11-25 08:52:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-11-25 08:52:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1074 transitions. [2019-11-25 08:52:31,882 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1074 transitions. Word has length 116 [2019-11-25 08:52:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:31,883 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1074 transitions. [2019-11-25 08:52:31,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1074 transitions. [2019-11-25 08:52:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-25 08:52:31,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:31,885 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:31,885 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2019-11-25 08:52:31,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:31,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403170263] [2019-11-25 08:52:31,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:31,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403170263] [2019-11-25 08:52:31,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602703879] [2019-11-25 08:52:31,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,951 INFO L87 Difference]: Start difference. First operand 720 states and 1074 transitions. Second operand 4 states. [2019-11-25 08:52:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:32,335 INFO L93 Difference]: Finished difference Result 1515 states and 2234 transitions. [2019-11-25 08:52:32,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:32,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-25 08:52:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:32,340 INFO L225 Difference]: With dead ends: 1515 [2019-11-25 08:52:32,341 INFO L226 Difference]: Without dead ends: 802 [2019-11-25 08:52:32,343 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:52:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-11-25 08:52:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-11-25 08:52:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1071 transitions. [2019-11-25 08:52:32,366 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1071 transitions. Word has length 117 [2019-11-25 08:52:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:32,367 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1071 transitions. [2019-11-25 08:52:32,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1071 transitions. [2019-11-25 08:52:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-25 08:52:32,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:32,369 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:32,369 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2019-11-25 08:52:32,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:32,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971076592] [2019-11-25 08:52:32,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:32,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971076592] [2019-11-25 08:52:32,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:32,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:32,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124578526] [2019-11-25 08:52:32,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:32,436 INFO L87 Difference]: Start difference. First operand 720 states and 1071 transitions. Second operand 4 states. [2019-11-25 08:52:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:32,763 INFO L93 Difference]: Finished difference Result 1488 states and 2195 transitions. [2019-11-25 08:52:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:32,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-25 08:52:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:32,769 INFO L225 Difference]: With dead ends: 1488 [2019-11-25 08:52:32,769 INFO L226 Difference]: Without dead ends: 775 [2019-11-25 08:52:32,770 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:52:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-25 08:52:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 720. [2019-11-25 08:52:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1068 transitions. [2019-11-25 08:52:32,790 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1068 transitions. Word has length 118 [2019-11-25 08:52:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:32,791 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1068 transitions. [2019-11-25 08:52:32,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1068 transitions. [2019-11-25 08:52:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-25 08:52:32,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:32,793 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2019-11-25 08:52:32,794 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2019-11-25 08:52:32,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:32,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407759580] [2019-11-25 08:52:32,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 133 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-25 08:52:32,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407759580] [2019-11-25 08:52:32,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772666660] [2019-11-25 08:52:32,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:33,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:52:33,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:33,185 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-25 08:52:33,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-25 08:52:33,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:52:33,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:52:33,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:52:33,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-25 08:52:33,220 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-25 08:52:33,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-25 08:52:33,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:52:33,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:52:33,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:52:33,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-25 08:52:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:33,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:52:33,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-25 08:52:33,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413711920] [2019-11-25 08:52:33,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:33,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:33,251 INFO L87 Difference]: Start difference. First operand 720 states and 1068 transitions. Second operand 4 states. [2019-11-25 08:52:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:33,684 INFO L93 Difference]: Finished difference Result 1488 states and 2189 transitions. [2019-11-25 08:52:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:33,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-25 08:52:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:33,689 INFO L225 Difference]: With dead ends: 1488 [2019-11-25 08:52:33,689 INFO L226 Difference]: Without dead ends: 775 [2019-11-25 08:52:33,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-25 08:52:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 720. [2019-11-25 08:52:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-25 08:52:33,717 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 118 [2019-11-25 08:52:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:33,718 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-25 08:52:33,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-25 08:52:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 08:52:33,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:33,720 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2019-11-25 08:52:33,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:33,933 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2019-11-25 08:52:33,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:33,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608631270] [2019-11-25 08:52:33,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 134 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-25 08:52:34,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608631270] [2019-11-25 08:52:34,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753466351] [2019-11-25 08:52:34,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:52:34,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:34,276 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-25 08:52:34,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-25 08:52:34,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:52:34,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:52:34,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:52:34,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-25 08:52:34,306 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-25 08:52:34,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-25 08:52:34,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:52:34,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:52:34,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:52:34,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-25 08:52:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:52:34,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:52:34,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-25 08:52:34,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887945573] [2019-11-25 08:52:34,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:34,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:34,340 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 4 states. [2019-11-25 08:52:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:34,733 INFO L93 Difference]: Finished difference Result 1476 states and 2167 transitions. [2019-11-25 08:52:34,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:34,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-25 08:52:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:34,738 INFO L225 Difference]: With dead ends: 1476 [2019-11-25 08:52:34,738 INFO L226 Difference]: Without dead ends: 763 [2019-11-25 08:52:34,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-11-25 08:52:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 720. [2019-11-25 08:52:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2019-11-25 08:52:34,761 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 119 [2019-11-25 08:52:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:34,761 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2019-11-25 08:52:34,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2019-11-25 08:52:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 08:52:34,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:34,764 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:34,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:34,968 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2019-11-25 08:52:34,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:34,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681919482] [2019-11-25 08:52:34,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-11-25 08:52:35,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681919482] [2019-11-25 08:52:35,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:35,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838404108] [2019-11-25 08:52:35,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:35,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:35,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:35,121 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 4 states. [2019-11-25 08:52:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:35,372 INFO L93 Difference]: Finished difference Result 1437 states and 2118 transitions. [2019-11-25 08:52:35,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:35,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-25 08:52:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:35,376 INFO L225 Difference]: With dead ends: 1437 [2019-11-25 08:52:35,377 INFO L226 Difference]: Without dead ends: 724 [2019-11-25 08:52:35,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:52:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-25 08:52:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 723. [2019-11-25 08:52:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-25 08:52:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1065 transitions. [2019-11-25 08:52:35,397 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1065 transitions. Word has length 122 [2019-11-25 08:52:35,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:35,397 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1065 transitions. [2019-11-25 08:52:35,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1065 transitions. [2019-11-25 08:52:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-25 08:52:35,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,400 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:35,400 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,400 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-11-25 08:52:35,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026595871] [2019-11-25 08:52:35,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:35,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:35,988 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:52:36,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:36 BoogieIcfgContainer [2019-11-25 08:52:36,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:36,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:36,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:36,141 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:36,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:21" (3/4) ... [2019-11-25 08:52:36,145 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:52:36,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:36,146 INFO L168 Benchmark]: Toolchain (without parser) took 17179.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 424.1 MB). Free memory was 946.1 MB in the beginning and 958.3 MB in the end (delta: -12.3 MB). Peak memory consumption was 411.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:36,147 INFO L168 Benchmark]: CDTParser took 0.46 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:52:36,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:36,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.06 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:52:36,148 INFO L168 Benchmark]: Boogie Preprocessor took 105.28 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:36,148 INFO L168 Benchmark]: RCFGBuilder took 1252.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.2 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:36,148 INFO L168 Benchmark]: TraceAbstraction took 15024.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 274.7 MB). Free memory was 1.0 GB in the beginning and 958.3 MB in the end (delta: 55.6 MB). Peak memory consumption was 330.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:36,149 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.5 GB. Free memory is still 958.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:36,151 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.46 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 702.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.06 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 105.28 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1252.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.2 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15024.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 274.7 MB). Free memory was 1.0 GB in the beginning and 958.3 MB in the end (delta: 55.6 MB). Peak memory consumption was 330.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.5 GB. Free memory is still 958.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={7:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1077] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={7:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={7:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={7:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={7:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={7:0}] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [init=1, SSLv3_client_data={7:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [init=1, SSLv3_client_data={7:0}] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [init=1, SSLv3_client_data={7:0}] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [init=1, SSLv3_client_data={7:0}] [L1326] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={7:0}] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [init=1, SSLv3_client_data={7:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={7:0}] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [init=1, SSLv3_client_data={7:0}] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={7:0}] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={7:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={7:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={7:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [init=1, SSLv3_client_data={7:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={7:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 29, TraceHistogramMax: 7, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5873 SDtfs, 1600 SDslu, 7516 SDs, 0 SdLazy, 3542 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 287 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 1352 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2817 NumberOfCodeBlocks, 2817 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2650 ConstructedInterpolants, 0 QuantifiedInterpolants, 666611 SizeOfPredicates, 6 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 30 InterpolantComputations, 28 PerfectInterpolantSequences, 3033/3035 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:52:37,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:37,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:37,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:37,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:37,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:37,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:37,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:37,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:37,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:37,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:37,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:37,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:37,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:37,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:37,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:37,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:37,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:37,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:37,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:37,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:37,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:37,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:37,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:37,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:37,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:37,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:37,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:37,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:37,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:37,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:37,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:37,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:37,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:37,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:37,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:37,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:37,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:37,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:37,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:37,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:37,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:52:38,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:38,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:38,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:38,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:38,025 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:38,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:38,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:38,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:38,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:38,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:38,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:38,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:38,028 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:52:38,029 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:52:38,029 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:38,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:38,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:38,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:38,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:38,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:38,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:38,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:38,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:38,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:38,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:38,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:38,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:38,032 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:52:38,033 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:52:38,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:38,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:52:38,033 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_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/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 -> 43b1f6793ee5eec863ad9b535d4bdfa9eec9aa4f [2019-11-25 08:52:38,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:38,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:38,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:38,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:38,301 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:38,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/../../sv-benchmarks/c/loops/s3.i [2019-11-25 08:52:38,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/98ccaf15c/17c24c8e0813455e96615134d2a112a6/FLAGd15e75e63 [2019-11-25 08:52:38,851 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:38,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/sv-benchmarks/c/loops/s3.i [2019-11-25 08:52:38,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/98ccaf15c/17c24c8e0813455e96615134d2a112a6/FLAGd15e75e63 [2019-11-25 08:52:39,373 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ccf6f946-f8a4-4c79-b655-22e8d2c5e550/bin/uautomizer/data/98ccaf15c/17c24c8e0813455e96615134d2a112a6 [2019-11-25 08:52:39,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:39,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:39,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:39,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:39,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:39,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:39" (1/1) ... [2019-11-25 08:52:39,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760aa42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:39, skipping insertion in model container [2019-11-25 08:52:39,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:39" (1/1) ... [2019-11-25 08:52:39,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:39,462 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:39,845 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:52:39,845 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1035] [2019-11-25 08:52:39,846 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:39,882 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:52:39,888 INFO L168 Benchmark]: Toolchain (without parser) took 510.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:39,889 INFO L168 Benchmark]: CDTParser took 0.22 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:52:39,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:39,894 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 508.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 28.2 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...