./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/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 dbebd8f3a7ff59c46b95280959676a0cf0887b44 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/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 dbebd8f3a7ff59c46b95280959676a0cf0887b44 ................................................................................................................................................................. 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:47:27,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:27,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:27,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:27,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:27,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:27,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:27,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:27,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:27,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:27,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:27,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:27,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:27,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:27,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:27,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:27,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:27,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:27,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:27,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:27,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:27,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:27,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:27,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:27,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:27,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:27,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:27,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:27,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:27,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:27,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:27,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:27,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:27,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:27,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:27,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:27,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:27,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:27,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:27,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:27,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:27,975 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:27,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:27,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:27,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:27,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:27,993 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:27,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:27,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:27,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:27,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:27,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:27,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:27,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:27,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:27,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:27,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:27,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:27,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:27,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:27,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:27,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:27,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:27,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:27,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:27,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:27,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:27,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:27,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:27,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:27,999 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_a2ce5112-e9a6-4711-815b-0f348acfd2a0/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 -> dbebd8f3a7ff59c46b95280959676a0cf0887b44 [2019-11-25 08:47:28,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:28,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:28,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:28,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:28,147 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:28,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-25 08:47:28,197 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/709b7139d/fbfc3ab0494f40da940f8b2ff6404a63/FLAGfa27e2af6 [2019-11-25 08:47:28,690 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:28,691 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-25 08:47:28,711 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/709b7139d/fbfc3ab0494f40da940f8b2ff6404a63/FLAGfa27e2af6 [2019-11-25 08:47:28,936 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/709b7139d/fbfc3ab0494f40da940f8b2ff6404a63 [2019-11-25 08:47:28,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:28,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:28,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:28,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:28,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:28,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:28" (1/1) ... [2019-11-25 08:47:28,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d944b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:28, skipping insertion in model container [2019-11-25 08:47:28,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:28" (1/1) ... [2019-11-25 08:47:28,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:29,034 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:29,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:29,524 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:29,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:29,679 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:29,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29 WrapperNode [2019-11-25 08:47:29,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:29,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:29,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:29,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:29,688 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:47:29" (1/1) ... [2019-11-25 08:47:29,723 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:47:29" (1/1) ... [2019-11-25 08:47:29,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:29,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:29,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:29,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:29,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... [2019-11-25 08:47:29,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:29,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:29,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:29,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:29,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/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:47:29,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:47:29,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:47:29,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:47:29,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:47:29,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:47:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:47:29,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:29,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:30,316 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:31,050 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:47:31,050 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:47:31,051 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:31,051 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:47:31,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:31 BoogieIcfgContainer [2019-11-25 08:47:31,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:31,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:31,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:31,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:31,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:28" (1/3) ... [2019-11-25 08:47:31,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7668b6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:31, skipping insertion in model container [2019-11-25 08:47:31,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:29" (2/3) ... [2019-11-25 08:47:31,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7668b6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:31, skipping insertion in model container [2019-11-25 08:47:31,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:31" (3/3) ... [2019-11-25 08:47:31,060 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-11-25 08:47:31,069 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:31,075 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:47:31,085 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:47:31,106 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:31,106 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:31,106 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:31,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:31,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:31,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:31,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:31,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-25 08:47:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:47:31,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:31,130 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:47:31,131 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-25 08:47:31,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:31,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868863477] [2019-11-25 08:47:31,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:31,427 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:47:31,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868863477] [2019-11-25 08:47:31,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:31,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:31,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764645883] [2019-11-25 08:47:31,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:31,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:31,445 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-25 08:47:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:31,945 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-25 08:47:31,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:31,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-25 08:47:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:31,961 INFO L225 Difference]: With dead ends: 255 [2019-11-25 08:47:31,961 INFO L226 Difference]: Without dead ends: 116 [2019-11-25 08:47:31,965 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:47:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-25 08:47:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-25 08:47:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-25 08:47:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-25 08:47:32,027 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-25 08:47:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,028 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-25 08:47:32,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-25 08:47:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:47:32,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,030 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-25 08:47:32,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161459676] [2019-11-25 08:47:32,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:32,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161459676] [2019-11-25 08:47:32,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:32,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676384155] [2019-11-25 08:47:32,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:32,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:32,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:32,187 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-25 08:47:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,238 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-25 08:47:32,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:32,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:47:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,241 INFO L225 Difference]: With dead ends: 321 [2019-11-25 08:47:32,241 INFO L226 Difference]: Without dead ends: 216 [2019-11-25 08:47:32,243 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:47:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-25 08:47:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-25 08:47:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-25 08:47:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-25 08:47:32,261 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-25 08:47:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,262 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-25 08:47:32,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-25 08:47:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:47:32,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,265 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] [2019-11-25 08:47:32,265 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-25 08:47:32,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974134008] [2019-11-25 08:47:32,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:32,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974134008] [2019-11-25 08:47:32,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:32,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368926476] [2019-11-25 08:47:32,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:32,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:32,438 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-25 08:47:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,523 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2019-11-25 08:47:32,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:32,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:47:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,527 INFO L225 Difference]: With dead ends: 421 [2019-11-25 08:47:32,528 INFO L226 Difference]: Without dead ends: 316 [2019-11-25 08:47:32,529 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:47:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-25 08:47:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-11-25 08:47:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-25 08:47:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2019-11-25 08:47:32,571 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2019-11-25 08:47:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,572 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2019-11-25 08:47:32,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2019-11-25 08:47:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:47:32,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,575 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,575 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2019-11-25 08:47:32,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386933785] [2019-11-25 08:47:32,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:32,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386933785] [2019-11-25 08:47:32,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:32,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824036502] [2019-11-25 08:47:32,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:32,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:32,706 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand 4 states. [2019-11-25 08:47:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:33,329 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2019-11-25 08:47:33,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:33,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:47:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:33,333 INFO L225 Difference]: With dead ends: 808 [2019-11-25 08:47:33,334 INFO L226 Difference]: Without dead ends: 502 [2019-11-25 08:47:33,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-25 08:47:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 366. [2019-11-25 08:47:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-25 08:47:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 553 transitions. [2019-11-25 08:47:33,372 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 553 transitions. Word has length 71 [2019-11-25 08:47:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:33,373 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 553 transitions. [2019-11-25 08:47:33,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 553 transitions. [2019-11-25 08:47:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:47:33,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:33,378 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:33,378 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1105291701, now seen corresponding path program 1 times [2019-11-25 08:47:33,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:33,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555874605] [2019-11-25 08:47:33,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:33,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555874605] [2019-11-25 08:47:33,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:33,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:33,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702143180] [2019-11-25 08:47:33,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:33,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:33,500 INFO L87 Difference]: Start difference. First operand 366 states and 553 transitions. Second operand 4 states. [2019-11-25 08:47:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:33,891 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2019-11-25 08:47:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:33,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:47:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:33,894 INFO L225 Difference]: With dead ends: 808 [2019-11-25 08:47:33,894 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:47:33,895 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:47:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:47:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2019-11-25 08:47:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-25 08:47:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 621 transitions. [2019-11-25 08:47:33,909 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 621 transitions. Word has length 71 [2019-11-25 08:47:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:33,910 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 621 transitions. [2019-11-25 08:47:33,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2019-11-25 08:47:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:47:33,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:33,912 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:33,912 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2019-11-25 08:47:33,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:33,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876244145] [2019-11-25 08:47:33,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:33,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876244145] [2019-11-25 08:47:33,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:33,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:33,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756928354] [2019-11-25 08:47:33,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:33,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:33,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:33,995 INFO L87 Difference]: Start difference. First operand 406 states and 621 transitions. Second operand 4 states. [2019-11-25 08:47:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:34,498 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2019-11-25 08:47:34,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:34,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-25 08:47:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:34,504 INFO L225 Difference]: With dead ends: 930 [2019-11-25 08:47:34,505 INFO L226 Difference]: Without dead ends: 534 [2019-11-25 08:47:34,506 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:47:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-25 08:47:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 408. [2019-11-25 08:47:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-11-25 08:47:34,523 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 72 [2019-11-25 08:47:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:34,527 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-11-25 08:47:34,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-11-25 08:47:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:47:34,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:34,530 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:34,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash -200583067, now seen corresponding path program 2 times [2019-11-25 08:47:34,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:34,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825751761] [2019-11-25 08:47:34,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:34,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825751761] [2019-11-25 08:47:34,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:34,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:34,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295693590] [2019-11-25 08:47:34,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:34,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:34,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:34,648 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-11-25 08:47:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:35,136 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2019-11-25 08:47:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:35,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:47:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:35,140 INFO L225 Difference]: With dead ends: 930 [2019-11-25 08:47:35,140 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:47:35,141 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:47:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:47:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-25 08:47:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 621 transitions. [2019-11-25 08:47:35,155 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 621 transitions. Word has length 85 [2019-11-25 08:47:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:35,155 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 621 transitions. [2019-11-25 08:47:35,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 621 transitions. [2019-11-25 08:47:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:47:35,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:35,157 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:35,157 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1309563513, now seen corresponding path program 1 times [2019-11-25 08:47:35,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:35,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662274644] [2019-11-25 08:47:35,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:35,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662274644] [2019-11-25 08:47:35,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:35,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:35,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5213464] [2019-11-25 08:47:35,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:35,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:35,279 INFO L87 Difference]: Start difference. First operand 408 states and 621 transitions. Second operand 4 states. [2019-11-25 08:47:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:35,799 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2019-11-25 08:47:35,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:35,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:47:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:35,803 INFO L225 Difference]: With dead ends: 930 [2019-11-25 08:47:35,803 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:47:35,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:47:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-25 08:47:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 619 transitions. [2019-11-25 08:47:35,817 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 619 transitions. Word has length 85 [2019-11-25 08:47:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:35,817 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 619 transitions. [2019-11-25 08:47:35,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 619 transitions. [2019-11-25 08:47:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:47:35,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:35,819 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:35,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1229942365, now seen corresponding path program 2 times [2019-11-25 08:47:35,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:35,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514525022] [2019-11-25 08:47:35,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:35,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514525022] [2019-11-25 08:47:35,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:35,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:35,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572264613] [2019-11-25 08:47:35,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:35,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:35,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:35,908 INFO L87 Difference]: Start difference. First operand 408 states and 619 transitions. Second operand 4 states. [2019-11-25 08:47:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:36,249 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2019-11-25 08:47:36,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:36,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:47:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:36,252 INFO L225 Difference]: With dead ends: 850 [2019-11-25 08:47:36,252 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:47:36,253 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:47:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:47:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-25 08:47:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 617 transitions. [2019-11-25 08:47:36,265 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 617 transitions. Word has length 85 [2019-11-25 08:47:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:36,266 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 617 transitions. [2019-11-25 08:47:36,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 617 transitions. [2019-11-25 08:47:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:47:36,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:36,267 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:36,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044485, now seen corresponding path program 1 times [2019-11-25 08:47:36,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:36,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692092285] [2019-11-25 08:47:36,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:36,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692092285] [2019-11-25 08:47:36,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:36,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8692235] [2019-11-25 08:47:36,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:36,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:36,340 INFO L87 Difference]: Start difference. First operand 408 states and 617 transitions. Second operand 4 states. [2019-11-25 08:47:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:36,734 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2019-11-25 08:47:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:36,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:47:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:36,739 INFO L225 Difference]: With dead ends: 850 [2019-11-25 08:47:36,739 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:47:36,740 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:47:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:47:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-25 08:47:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 615 transitions. [2019-11-25 08:47:36,753 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 615 transitions. Word has length 85 [2019-11-25 08:47:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:36,754 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 615 transitions. [2019-11-25 08:47:36,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 615 transitions. [2019-11-25 08:47:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:47:36,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:36,755 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:36,756 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1887370232, now seen corresponding path program 1 times [2019-11-25 08:47:36,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:36,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638726227] [2019-11-25 08:47:36,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:36,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638726227] [2019-11-25 08:47:36,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:36,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:36,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051895036] [2019-11-25 08:47:36,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:36,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:36,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:36,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:36,831 INFO L87 Difference]: Start difference. First operand 408 states and 615 transitions. Second operand 4 states. [2019-11-25 08:47:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:37,353 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2019-11-25 08:47:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:37,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:47:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:37,357 INFO L225 Difference]: With dead ends: 930 [2019-11-25 08:47:37,357 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:47:37,359 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:47:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:47:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-25 08:47:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2019-11-25 08:47:37,371 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 86 [2019-11-25 08:47:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:37,371 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2019-11-25 08:47:37,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2019-11-25 08:47:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:47:37,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:37,373 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-25 08:47:37,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:37,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1587309149, now seen corresponding path program 1 times [2019-11-25 08:47:37,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:37,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57071054] [2019-11-25 08:47:37,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:37,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57071054] [2019-11-25 08:47:37,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:37,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:37,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639940847] [2019-11-25 08:47:37,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:37,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:37,446 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand 4 states. [2019-11-25 08:47:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:37,955 INFO L93 Difference]: Finished difference Result 785 states and 1170 transitions. [2019-11-25 08:47:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:37,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:47:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:37,958 INFO L225 Difference]: With dead ends: 785 [2019-11-25 08:47:37,958 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:47:37,959 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:47:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:47:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-25 08:47:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 611 transitions. [2019-11-25 08:47:37,972 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 611 transitions. Word has length 86 [2019-11-25 08:47:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:37,972 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 611 transitions. [2019-11-25 08:47:37,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 611 transitions. [2019-11-25 08:47:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:47:37,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:37,974 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:37,974 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 562229898, now seen corresponding path program 1 times [2019-11-25 08:47:37,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:37,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468929048] [2019-11-25 08:47:37,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:38,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468929048] [2019-11-25 08:47:38,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:38,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:38,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754272113] [2019-11-25 08:47:38,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:38,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:38,038 INFO L87 Difference]: Start difference. First operand 408 states and 611 transitions. Second operand 4 states. [2019-11-25 08:47:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:38,471 INFO L93 Difference]: Finished difference Result 850 states and 1264 transitions. [2019-11-25 08:47:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:38,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:47:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:38,474 INFO L225 Difference]: With dead ends: 850 [2019-11-25 08:47:38,474 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:47:38,475 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:47:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:47:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-25 08:47:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 609 transitions. [2019-11-25 08:47:38,487 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 609 transitions. Word has length 86 [2019-11-25 08:47:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:38,488 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 609 transitions. [2019-11-25 08:47:38,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 609 transitions. [2019-11-25 08:47:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:47:38,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:38,490 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-25 08:47:38,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash 862290981, now seen corresponding path program 1 times [2019-11-25 08:47:38,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:38,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046392080] [2019-11-25 08:47:38,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:38,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046392080] [2019-11-25 08:47:38,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:38,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:38,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833385037] [2019-11-25 08:47:38,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:38,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:38,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:38,581 INFO L87 Difference]: Start difference. First operand 408 states and 609 transitions. Second operand 4 states. [2019-11-25 08:47:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:38,929 INFO L93 Difference]: Finished difference Result 705 states and 1043 transitions. [2019-11-25 08:47:38,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:38,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:47:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:38,932 INFO L225 Difference]: With dead ends: 705 [2019-11-25 08:47:38,932 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:47:38,933 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:47:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:47:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-25 08:47:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-11-25 08:47:38,946 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 86 [2019-11-25 08:47:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:38,946 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-11-25 08:47:38,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-11-25 08:47:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:47:38,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:38,948 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:38,949 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1732038594, now seen corresponding path program 1 times [2019-11-25 08:47:38,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:38,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579090693] [2019-11-25 08:47:38,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:39,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579090693] [2019-11-25 08:47:39,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:39,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:39,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402052308] [2019-11-25 08:47:39,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:39,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:39,032 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 4 states. [2019-11-25 08:47:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:39,508 INFO L93 Difference]: Finished difference Result 930 states and 1377 transitions. [2019-11-25 08:47:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:39,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:47:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:39,512 INFO L225 Difference]: With dead ends: 930 [2019-11-25 08:47:39,512 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:47:39,513 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:47:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:47:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-25 08:47:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2019-11-25 08:47:39,529 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 87 [2019-11-25 08:47:39,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:39,529 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2019-11-25 08:47:39,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2019-11-25 08:47:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:47:39,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:39,531 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-25 08:47:39,531 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:39,532 INFO L82 PathProgramCache]: Analyzing trace with hash 442060930, now seen corresponding path program 1 times [2019-11-25 08:47:39,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:39,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092882919] [2019-11-25 08:47:39,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:39,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092882919] [2019-11-25 08:47:39,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:39,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:39,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108349295] [2019-11-25 08:47:39,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:39,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:39,610 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand 4 states. [2019-11-25 08:47:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:40,106 INFO L93 Difference]: Finished difference Result 779 states and 1151 transitions. [2019-11-25 08:47:40,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:40,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:47:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:40,110 INFO L225 Difference]: With dead ends: 779 [2019-11-25 08:47:40,110 INFO L226 Difference]: Without dead ends: 526 [2019-11-25 08:47:40,111 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:47:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-25 08:47:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 408. [2019-11-25 08:47:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 603 transitions. [2019-11-25 08:47:40,123 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 603 transitions. Word has length 87 [2019-11-25 08:47:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:40,124 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 603 transitions. [2019-11-25 08:47:40,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 603 transitions. [2019-11-25 08:47:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:47:40,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:40,126 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:40,126 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 360231296, now seen corresponding path program 1 times [2019-11-25 08:47:40,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336292983] [2019-11-25 08:47:40,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:40,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336292983] [2019-11-25 08:47:40,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:40,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:40,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401300853] [2019-11-25 08:47:40,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:40,219 INFO L87 Difference]: Start difference. First operand 408 states and 603 transitions. Second operand 4 states. [2019-11-25 08:47:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:40,585 INFO L93 Difference]: Finished difference Result 850 states and 1248 transitions. [2019-11-25 08:47:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:40,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:47:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:40,589 INFO L225 Difference]: With dead ends: 850 [2019-11-25 08:47:40,589 INFO L226 Difference]: Without dead ends: 452 [2019-11-25 08:47:40,589 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:47:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-25 08:47:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-25 08:47:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 601 transitions. [2019-11-25 08:47:40,602 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 601 transitions. Word has length 87 [2019-11-25 08:47:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:40,602 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 601 transitions. [2019-11-25 08:47:40,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:40,602 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 601 transitions. [2019-11-25 08:47:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:47:40,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:40,604 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-25 08:47:40,604 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,605 INFO L82 PathProgramCache]: Analyzing trace with hash -929746368, now seen corresponding path program 1 times [2019-11-25 08:47:40,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444288158] [2019-11-25 08:47:40,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:40,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444288158] [2019-11-25 08:47:40,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:40,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:40,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521908885] [2019-11-25 08:47:40,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:40,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:40,667 INFO L87 Difference]: Start difference. First operand 408 states and 601 transitions. Second operand 4 states. [2019-11-25 08:47:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,006 INFO L93 Difference]: Finished difference Result 699 states and 1024 transitions. [2019-11-25 08:47:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:41,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:47:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,010 INFO L225 Difference]: With dead ends: 699 [2019-11-25 08:47:41,010 INFO L226 Difference]: Without dead ends: 446 [2019-11-25 08:47:41,010 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:47:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-25 08:47:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 408. [2019-11-25 08:47:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 599 transitions. [2019-11-25 08:47:41,022 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 599 transitions. Word has length 87 [2019-11-25 08:47:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,022 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 599 transitions. [2019-11-25 08:47:41,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 599 transitions. [2019-11-25 08:47:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:47:41,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,024 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,024 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1973824157, now seen corresponding path program 1 times [2019-11-25 08:47:41,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403304914] [2019-11-25 08:47:41,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:41,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403304914] [2019-11-25 08:47:41,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:41,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857999147] [2019-11-25 08:47:41,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:41,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:41,083 INFO L87 Difference]: Start difference. First operand 408 states and 599 transitions. Second operand 4 states. [2019-11-25 08:47:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,483 INFO L93 Difference]: Finished difference Result 906 states and 1332 transitions. [2019-11-25 08:47:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:41,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:47:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,486 INFO L225 Difference]: With dead ends: 906 [2019-11-25 08:47:41,486 INFO L226 Difference]: Without dead ends: 508 [2019-11-25 08:47:41,487 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:47:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-25 08:47:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-11-25 08:47:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 597 transitions. [2019-11-25 08:47:41,499 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 597 transitions. Word has length 88 [2019-11-25 08:47:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,499 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 597 transitions. [2019-11-25 08:47:41,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 597 transitions. [2019-11-25 08:47:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:47:41,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,501 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,501 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1550177435, now seen corresponding path program 1 times [2019-11-25 08:47:41,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214232896] [2019-11-25 08:47:41,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:41,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214232896] [2019-11-25 08:47:41,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:41,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049680575] [2019-11-25 08:47:41,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:41,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:41,566 INFO L87 Difference]: Start difference. First operand 408 states and 597 transitions. Second operand 4 states. [2019-11-25 08:47:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,870 INFO L93 Difference]: Finished difference Result 826 states and 1207 transitions. [2019-11-25 08:47:41,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:41,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:47:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,873 INFO L225 Difference]: With dead ends: 826 [2019-11-25 08:47:41,873 INFO L226 Difference]: Without dead ends: 428 [2019-11-25 08:47:41,874 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:47:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-25 08:47:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 408. [2019-11-25 08:47:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 595 transitions. [2019-11-25 08:47:41,885 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 595 transitions. Word has length 88 [2019-11-25 08:47:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,885 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 595 transitions. [2019-11-25 08:47:41,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 595 transitions. [2019-11-25 08:47:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:47:41,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,887 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] [2019-11-25 08:47:41,887 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 114296894, now seen corresponding path program 1 times [2019-11-25 08:47:41,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942164173] [2019-11-25 08:47:41,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:47:41,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942164173] [2019-11-25 08:47:41,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:41,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759454666] [2019-11-25 08:47:41,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:41,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:41,959 INFO L87 Difference]: Start difference. First operand 408 states and 595 transitions. Second operand 4 states. [2019-11-25 08:47:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,389 INFO L93 Difference]: Finished difference Result 906 states and 1324 transitions. [2019-11-25 08:47:42,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:42,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:47:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,392 INFO L225 Difference]: With dead ends: 906 [2019-11-25 08:47:42,392 INFO L226 Difference]: Without dead ends: 508 [2019-11-25 08:47:42,395 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:47:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-25 08:47:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-11-25 08:47:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-25 08:47:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 593 transitions. [2019-11-25 08:47:42,406 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 593 transitions. Word has length 89 [2019-11-25 08:47:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,407 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 593 transitions. [2019-11-25 08:47:42,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 593 transitions. [2019-11-25 08:47:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:47:42,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,408 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] [2019-11-25 08:47:42,409 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 362443388, now seen corresponding path program 1 times [2019-11-25 08:47:42,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851331453] [2019-11-25 08:47:42,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:47:42,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851331453] [2019-11-25 08:47:42,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192888662] [2019-11-25 08:47:42,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,470 INFO L87 Difference]: Start difference. First operand 408 states and 593 transitions. Second operand 3 states. [2019-11-25 08:47:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,510 INFO L93 Difference]: Finished difference Result 808 states and 1181 transitions. [2019-11-25 08:47:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:47:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,515 INFO L225 Difference]: With dead ends: 808 [2019-11-25 08:47:42,515 INFO L226 Difference]: Without dead ends: 557 [2019-11-25 08:47:42,516 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:47:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-25 08:47:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-11-25 08:47:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-11-25 08:47:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 810 transitions. [2019-11-25 08:47:42,533 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 810 transitions. Word has length 89 [2019-11-25 08:47:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,534 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 810 transitions. [2019-11-25 08:47:42,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 810 transitions. [2019-11-25 08:47:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-25 08:47:42,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,536 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] [2019-11-25 08:47:42,536 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash 846505389, now seen corresponding path program 1 times [2019-11-25 08:47:42,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929898544] [2019-11-25 08:47:42,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-25 08:47:42,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929898544] [2019-11-25 08:47:42,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150297992] [2019-11-25 08:47:42,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,603 INFO L87 Difference]: Start difference. First operand 557 states and 810 transitions. Second operand 3 states. [2019-11-25 08:47:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,638 INFO L93 Difference]: Finished difference Result 1106 states and 1615 transitions. [2019-11-25 08:47:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-25 08:47:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,643 INFO L225 Difference]: With dead ends: 1106 [2019-11-25 08:47:42,643 INFO L226 Difference]: Without dead ends: 706 [2019-11-25 08:47:42,644 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:47:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-11-25 08:47:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2019-11-25 08:47:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-25 08:47:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1028 transitions. [2019-11-25 08:47:42,664 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1028 transitions. Word has length 91 [2019-11-25 08:47:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,665 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 1028 transitions. [2019-11-25 08:47:42,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1028 transitions. [2019-11-25 08:47:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:47:42,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,669 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] [2019-11-25 08:47:42,669 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-11-25 08:47:42,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561989122] [2019-11-25 08:47:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:43,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:43,134 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:43,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:43 BoogieIcfgContainer [2019-11-25 08:47:43,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:43,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:43,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:43,247 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:43,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:31" (3/4) ... [2019-11-25 08:47:43,258 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:47:43,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:43,274 INFO L168 Benchmark]: Toolchain (without parser) took 14335.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 247.5 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,275 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:43,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,276 INFO L168 Benchmark]: Boogie Preprocessor took 119.38 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,276 INFO L168 Benchmark]: RCFGBuilder took 1157.54 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: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:43,276 INFO L168 Benchmark]: TraceAbstraction took 12192.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -145.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:43,277 INFO L168 Benchmark]: Witness Printer took 25.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:43,279 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.38 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1157.54 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: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12192.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -145.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 25.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1332. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={9:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1328] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4904 SDtfs, 1791 SDslu, 6306 SDs, 0 SdLazy, 3606 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=706occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 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:47:45,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:45,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:45,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:45,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:45,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:45,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:45,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:45,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:45,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:45,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:45,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:45,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:45,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:45,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:45,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:45,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:45,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:45,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:45,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:45,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:45,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:45,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:45,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:45,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:45,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:45,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:45,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:45,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:45,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:45,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:45,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:45,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:45,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:45,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:45,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:45,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:45,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:45,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:45,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:45,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:45,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:47:45,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:45,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:45,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:45,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:45,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:45,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:45,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:45,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:45,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:45,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:45,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:45,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:45,440 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:47:45,440 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:47:45,440 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:47:45,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:45,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:45,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:45,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:45,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:45,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:45,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:45,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:45,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:45,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:45,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:45,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:45,444 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:47:45,445 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:47:45,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:45,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:47:45,445 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_a2ce5112-e9a6-4711-815b-0f348acfd2a0/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 -> dbebd8f3a7ff59c46b95280959676a0cf0887b44 [2019-11-25 08:47:45,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:45,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:45,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:45,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:45,727 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:45,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-25 08:47:45,777 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/7af67efca/6a25cdd637a04064bbf13762bbdec379/FLAG36301d013 [2019-11-25 08:47:46,208 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:46,209 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-25 08:47:46,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/7af67efca/6a25cdd637a04064bbf13762bbdec379/FLAG36301d013 [2019-11-25 08:47:46,526 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2ce5112-e9a6-4711-815b-0f348acfd2a0/bin/uautomizer/data/7af67efca/6a25cdd637a04064bbf13762bbdec379 [2019-11-25 08:47:46,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:46,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:46,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:46,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:46,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:46,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:46" (1/1) ... [2019-11-25 08:47:46,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abc4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:46, skipping insertion in model container [2019-11-25 08:47:46,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:46" (1/1) ... [2019-11-25 08:47:46,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:46,623 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:46,933 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:47:46,934 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:47:46,934 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:47:46,943 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:47:46,944 INFO L968 CHandler]: at location: C: (SSL*)malloc(sizeof(SSL)) [1065] [2019-11-25 08:47:46,944 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:47:47,033 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:47:47,041 INFO L168 Benchmark]: Toolchain (without parser) took 508.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:47,042 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:47,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:47,045 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 502.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 28.5 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...