./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/20_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/20_lamport.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/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 4bd0a104431602f65d67040bef1f743648c257ee ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:17,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:17,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:17,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:17,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:17,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:17,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:17,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:17,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:17,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:17,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:17,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:17,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:17,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:17,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:17,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:17,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:17,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:17,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:17,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:17,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:17,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:17,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:17,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:17,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:17,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:17,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:17,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:17,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:17,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:17,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:17,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:17,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:17,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:17,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:17,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:17,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:17,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:17,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:17,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:17,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:17,841 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:17,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:17,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:17,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:17,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:17,877 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:17,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:17,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:17,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:17,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:17,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:17,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:17,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:17,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:17,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:17,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:17,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:17,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:17,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:17,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:17,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:17,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:17,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:17,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:17,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:17,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:17,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:17,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:17,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:17,881 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_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/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 -> 4bd0a104431602f65d67040bef1f743648c257ee [2019-11-25 08:49:18,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:18,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:18,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:18,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:18,070 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:18,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/../../sv-benchmarks/c/pthread-ext/20_lamport.i [2019-11-25 08:49:18,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/data/6c695f762/0be5cdf40c014b0b9c478446e7099e2f/FLAGc291f9862 [2019-11-25 08:49:18,557 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:18,558 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/sv-benchmarks/c/pthread-ext/20_lamport.i [2019-11-25 08:49:18,572 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/data/6c695f762/0be5cdf40c014b0b9c478446e7099e2f/FLAGc291f9862 [2019-11-25 08:49:18,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/data/6c695f762/0be5cdf40c014b0b9c478446e7099e2f [2019-11-25 08:49:18,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:18,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:18,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:18,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:18,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:18,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:18" (1/1) ... [2019-11-25 08:49:18,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe2060b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:18, skipping insertion in model container [2019-11-25 08:49:18,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:18" (1/1) ... [2019-11-25 08:49:18,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:18,641 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:18,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:18,993 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:19,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:19,094 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:19,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19 WrapperNode [2019-11-25 08:49:19,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:19,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:19,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:19,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:19,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:19,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:19,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:19,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:19,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... [2019-11-25 08:49:19,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:19,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:19,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:19,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:19,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:19,212 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-25 08:49:19,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-25 08:49:19,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:49:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:19,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:19,214 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:49:19,642 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:19,642 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-25 08:49:19,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:19 BoogieIcfgContainer [2019-11-25 08:49:19,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:19,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:19,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:19,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:19,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:18" (1/3) ... [2019-11-25 08:49:19,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255ab30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:19, skipping insertion in model container [2019-11-25 08:49:19,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:19" (2/3) ... [2019-11-25 08:49:19,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255ab30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:19, skipping insertion in model container [2019-11-25 08:49:19,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:19" (3/3) ... [2019-11-25 08:49:19,650 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-11-25 08:49:19,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,682 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,682 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,684 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:19,697 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:49:19,697 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:19,704 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:49:19,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:49:19,726 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:19,726 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:19,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:19,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:19,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:19,727 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:19,727 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:19,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:19,738 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 161 transitions [2019-11-25 08:49:19,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 772 states. [2019-11-25 08:49:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states. [2019-11-25 08:49:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:49:19,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:19,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:19,822 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1617836640, now seen corresponding path program 1 times [2019-11-25 08:49:19,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:19,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493666562] [2019-11-25 08:49:19,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:19,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493666562] [2019-11-25 08:49:19,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:19,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:19,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242086229] [2019-11-25 08:49:19,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:49:19,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:49:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:49:19,996 INFO L87 Difference]: Start difference. First operand 772 states. Second operand 2 states. [2019-11-25 08:49:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,034 INFO L93 Difference]: Finished difference Result 772 states and 1811 transitions. [2019-11-25 08:49:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:49:20,035 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-25 08:49:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,057 INFO L225 Difference]: With dead ends: 772 [2019-11-25 08:49:20,057 INFO L226 Difference]: Without dead ends: 717 [2019-11-25 08:49:20,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:49:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-25 08:49:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-11-25 08:49:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-25 08:49:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1701 transitions. [2019-11-25 08:49:20,165 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1701 transitions. Word has length 18 [2019-11-25 08:49:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,166 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1701 transitions. [2019-11-25 08:49:20,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:49:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1701 transitions. [2019-11-25 08:49:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:49:20,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,168 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:49:20,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1347863924, now seen corresponding path program 1 times [2019-11-25 08:49:20,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722570420] [2019-11-25 08:49:20,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:20,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722570420] [2019-11-25 08:49:20,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:20,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:20,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289106806] [2019-11-25 08:49:20,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:20,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:20,248 INFO L87 Difference]: Start difference. First operand 717 states and 1701 transitions. Second operand 3 states. [2019-11-25 08:49:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,290 INFO L93 Difference]: Finished difference Result 708 states and 1650 transitions. [2019-11-25 08:49:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:49:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,296 INFO L225 Difference]: With dead ends: 708 [2019-11-25 08:49:20,296 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:49:20,297 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:49:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:49:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 517. [2019-11-25 08:49:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-25 08:49:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1222 transitions. [2019-11-25 08:49:20,333 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1222 transitions. Word has length 24 [2019-11-25 08:49:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,334 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 1222 transitions. [2019-11-25 08:49:20,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1222 transitions. [2019-11-25 08:49:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:49:20,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:20,337 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1067144065, now seen corresponding path program 1 times [2019-11-25 08:49:20,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246388482] [2019-11-25 08:49:20,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:20,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246388482] [2019-11-25 08:49:20,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:20,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:20,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560504282] [2019-11-25 08:49:20,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:20,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:20,379 INFO L87 Difference]: Start difference. First operand 517 states and 1222 transitions. Second operand 3 states. [2019-11-25 08:49:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,412 INFO L93 Difference]: Finished difference Result 486 states and 1141 transitions. [2019-11-25 08:49:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:49:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,418 INFO L225 Difference]: With dead ends: 486 [2019-11-25 08:49:20,418 INFO L226 Difference]: Without dead ends: 386 [2019-11-25 08:49:20,418 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:49:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-25 08:49:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2019-11-25 08:49:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-25 08:49:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 917 transitions. [2019-11-25 08:49:20,443 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 917 transitions. Word has length 28 [2019-11-25 08:49:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,445 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 917 transitions. [2019-11-25 08:49:20,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 917 transitions. [2019-11-25 08:49:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:20,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:20,458 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1947423709, now seen corresponding path program 1 times [2019-11-25 08:49:20,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657801358] [2019-11-25 08:49:20,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:20,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657801358] [2019-11-25 08:49:20,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:20,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:20,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221898594] [2019-11-25 08:49:20,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:20,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:20,522 INFO L87 Difference]: Start difference. First operand 386 states and 917 transitions. Second operand 3 states. [2019-11-25 08:49:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,589 INFO L93 Difference]: Finished difference Result 495 states and 1166 transitions. [2019-11-25 08:49:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,593 INFO L225 Difference]: With dead ends: 495 [2019-11-25 08:49:20,593 INFO L226 Difference]: Without dead ends: 408 [2019-11-25 08:49:20,593 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:49:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-25 08:49:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 391. [2019-11-25 08:49:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-25 08:49:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 903 transitions. [2019-11-25 08:49:20,607 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 903 transitions. Word has length 37 [2019-11-25 08:49:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,608 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 903 transitions. [2019-11-25 08:49:20,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 903 transitions. [2019-11-25 08:49:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:20,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:20,610 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash 28888026, now seen corresponding path program 1 times [2019-11-25 08:49:20,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283074707] [2019-11-25 08:49:20,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:20,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283074707] [2019-11-25 08:49:20,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:20,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:20,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873673083] [2019-11-25 08:49:20,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:20,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:20,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:20,654 INFO L87 Difference]: Start difference. First operand 391 states and 903 transitions. Second operand 3 states. [2019-11-25 08:49:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,685 INFO L93 Difference]: Finished difference Result 571 states and 1235 transitions. [2019-11-25 08:49:20,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,692 INFO L225 Difference]: With dead ends: 571 [2019-11-25 08:49:20,693 INFO L226 Difference]: Without dead ends: 571 [2019-11-25 08:49:20,694 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:49:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-25 08:49:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 412. [2019-11-25 08:49:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-25 08:49:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 931 transitions. [2019-11-25 08:49:20,708 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 931 transitions. Word has length 37 [2019-11-25 08:49:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,710 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 931 transitions. [2019-11-25 08:49:20,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 931 transitions. [2019-11-25 08:49:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:20,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:20,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1814822961, now seen corresponding path program 2 times [2019-11-25 08:49:20,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563061864] [2019-11-25 08:49:20,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:20,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563061864] [2019-11-25 08:49:20,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:20,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:20,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78905833] [2019-11-25 08:49:20,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:20,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:20,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:20,786 INFO L87 Difference]: Start difference. First operand 412 states and 931 transitions. Second operand 4 states. [2019-11-25 08:49:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,816 INFO L93 Difference]: Finished difference Result 504 states and 1038 transitions. [2019-11-25 08:49:20,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-25 08:49:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,822 INFO L225 Difference]: With dead ends: 504 [2019-11-25 08:49:20,822 INFO L226 Difference]: Without dead ends: 501 [2019-11-25 08:49:20,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-25 08:49:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 385. [2019-11-25 08:49:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-25 08:49:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 824 transitions. [2019-11-25 08:49:20,842 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 824 transitions. Word has length 37 [2019-11-25 08:49:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,843 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 824 transitions. [2019-11-25 08:49:20,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 824 transitions. [2019-11-25 08:49:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:20,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:20,846 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1322277612, now seen corresponding path program 2 times [2019-11-25 08:49:20,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849677200] [2019-11-25 08:49:20,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:20,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849677200] [2019-11-25 08:49:20,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:20,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:20,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346033648] [2019-11-25 08:49:20,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:20,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:20,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:20,906 INFO L87 Difference]: Start difference. First operand 385 states and 824 transitions. Second operand 3 states. [2019-11-25 08:49:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,967 INFO L93 Difference]: Finished difference Result 344 states and 669 transitions. [2019-11-25 08:49:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,970 INFO L225 Difference]: With dead ends: 344 [2019-11-25 08:49:20,970 INFO L226 Difference]: Without dead ends: 266 [2019-11-25 08:49:20,970 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:49:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-25 08:49:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 237. [2019-11-25 08:49:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-25 08:49:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 447 transitions. [2019-11-25 08:49:20,980 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 447 transitions. Word has length 37 [2019-11-25 08:49:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,982 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 447 transitions. [2019-11-25 08:49:20,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 447 transitions. [2019-11-25 08:49:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:49:20,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:20,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:20,984 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash 515522864, now seen corresponding path program 1 times [2019-11-25 08:49:20,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:20,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128576811] [2019-11-25 08:49:20,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:21,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128576811] [2019-11-25 08:49:21,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:21,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:21,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435786396] [2019-11-25 08:49:21,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:21,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:21,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:21,039 INFO L87 Difference]: Start difference. First operand 237 states and 447 transitions. Second operand 3 states. [2019-11-25 08:49:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:21,053 INFO L93 Difference]: Finished difference Result 229 states and 431 transitions. [2019-11-25 08:49:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:21,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-25 08:49:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:21,055 INFO L225 Difference]: With dead ends: 229 [2019-11-25 08:49:21,055 INFO L226 Difference]: Without dead ends: 205 [2019-11-25 08:49:21,056 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:49:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-25 08:49:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-11-25 08:49:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-25 08:49:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 386 transitions. [2019-11-25 08:49:21,063 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 386 transitions. Word has length 40 [2019-11-25 08:49:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:21,064 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 386 transitions. [2019-11-25 08:49:21,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 386 transitions. [2019-11-25 08:49:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:49:21,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:21,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:21,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:21,066 INFO L82 PathProgramCache]: Analyzing trace with hash -682160464, now seen corresponding path program 1 times [2019-11-25 08:49:21,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:21,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379228152] [2019-11-25 08:49:21,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:21,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379228152] [2019-11-25 08:49:21,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:21,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:21,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634919720] [2019-11-25 08:49:21,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:21,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:21,126 INFO L87 Difference]: Start difference. First operand 205 states and 386 transitions. Second operand 3 states. [2019-11-25 08:49:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:21,137 INFO L93 Difference]: Finished difference Result 140 states and 282 transitions. [2019-11-25 08:49:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:21,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-25 08:49:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:21,138 INFO L225 Difference]: With dead ends: 140 [2019-11-25 08:49:21,138 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:49:21,139 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:49:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:49:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:49:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:49:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:49:21,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-11-25 08:49:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:21,140 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:49:21,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:49:21,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:49:21,147 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:49:21,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:21 BasicIcfg [2019-11-25 08:49:21,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:21,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:21,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:21,151 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:21,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:19" (3/4) ... [2019-11-25 08:49:21,156 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:49:21,163 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-25 08:49:21,177 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 08:49:21,191 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:49:21,191 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:49:21,238 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7ab59aaa-fda7-4bbb-a1ea-513b37d7c50f/bin/uautomizer/witness.graphml [2019-11-25 08:49:21,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:21,241 INFO L168 Benchmark]: Toolchain (without parser) took 2653.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.8 MB in the beginning and 940.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,241 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:21,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,250 INFO L168 Benchmark]: Boogie Preprocessor took 25.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:21,250 INFO L168 Benchmark]: RCFGBuilder took 480.98 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,251 INFO L168 Benchmark]: TraceAbstraction took 1505.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.1 MB in the end (delta: 150.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,251 INFO L168 Benchmark]: Witness Printer took 88.80 ms. Allocated memory is still 1.2 GB. Free memory was 946.1 MB in the beginning and 940.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,253 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 480.98 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1505.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.1 MB in the end (delta: 150.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. * Witness Printer took 88.80 ms. Allocated memory is still 1.2 GB. Free memory was 946.1 MB in the beginning and 940.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 724]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 138 locations, 5 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 783 SDtfs, 282 SDslu, 506 SDs, 0 SdLazy, 92 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 13311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...