./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.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_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/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 18f8c11d6085f6594f0f2021411e68b8ac706f42 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:52:29,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:29,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:29,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:29,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:29,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:29,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:29,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:29,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:29,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:29,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:29,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:29,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:29,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:29,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:29,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:29,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:29,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:29,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:29,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:29,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:29,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:29,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:29,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:29,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:29,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:29,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:29,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:29,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:29,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:29,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:29,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:29,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:29,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:29,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:29,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:29,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:29,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:29,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:29,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:29,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:29,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:29,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:29,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:29,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:29,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:29,172 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:29,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:29,172 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:29,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:29,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:29,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:29,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:29,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:29,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:29,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:29,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:29,175 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:29,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:29,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:29,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:29,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:29,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:29,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:29,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:29,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:29,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:29,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:29,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:29,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:29,178 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_174afce2-83c3-4558-8866-4576a4446721/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 -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-25 08:52:29,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:29,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:29,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:29,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:29,355 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:29,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-25 08:52:29,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/data/d1efc081d/41827f9b18ae47f8a688b20fc08178bf/FLAG90e06f461 [2019-11-25 08:52:29,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:29,860 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-25 08:52:29,874 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/data/d1efc081d/41827f9b18ae47f8a688b20fc08178bf/FLAG90e06f461 [2019-11-25 08:52:30,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/data/d1efc081d/41827f9b18ae47f8a688b20fc08178bf [2019-11-25 08:52:30,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:30,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:30,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:30,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:30,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:30,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@514cabe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30, skipping insertion in model container [2019-11-25 08:52:30,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:30,293 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:30,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:30,725 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:30,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:30,857 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:30,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30 WrapperNode [2019-11-25 08:52:30,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:30,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:30,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:30,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:30,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:30,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:30,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:30,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:30,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:30,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:30,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:30,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:30,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:30,999 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-25 08:52:30,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-25 08:52:30,999 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-25 08:52:30,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-25 08:52:31,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:52:31,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:52:31,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:52:31,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:31,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:31,004 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:52:31,330 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:31,330 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:52:31,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:31 BoogieIcfgContainer [2019-11-25 08:52:31,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:31,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:31,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:31,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:31,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:30" (1/3) ... [2019-11-25 08:52:31,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5ca58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:31, skipping insertion in model container [2019-11-25 08:52:31,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (2/3) ... [2019-11-25 08:52:31,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5ca58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:31, skipping insertion in model container [2019-11-25 08:52:31,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:31" (3/3) ... [2019-11-25 08:52:31,337 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-25 08:52:31,373 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,373 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,373 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,374 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,374 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,374 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,375 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,375 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,375 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,375 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,377 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,377 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,377 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,377 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,378 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,378 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,378 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,382 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,382 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,382 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,382 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,383 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,384 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,384 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,384 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,385 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,385 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,385 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,385 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,385 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,386 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,386 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:52:31,409 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:52:31,410 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:31,416 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-25 08:52:31,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-25 08:52:31,443 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:31,444 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:31,444 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:31,444 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:31,444 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:31,444 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:31,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:31,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:31,455 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-25 08:52:34,779 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-25 08:52:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-25 08:52:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:52:34,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:34,790 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] [2019-11-25 08:52:34,791 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-25 08:52:34,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:34,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737881109] [2019-11-25 08:52:34,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:35,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737881109] [2019-11-25 08:52:35,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:52:35,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424914942] [2019-11-25 08:52:35,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:35,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:35,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:35,126 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-25 08:52:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:36,215 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-25 08:52:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:52:36,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-25 08:52:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:36,436 INFO L225 Difference]: With dead ends: 45470 [2019-11-25 08:52:36,436 INFO L226 Difference]: Without dead ends: 20819 [2019-11-25 08:52:36,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:52:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-25 08:52:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-25 08:52:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-25 08:52:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-25 08:52:37,561 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-25 08:52:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,561 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-25 08:52:37,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-25 08:52:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:52:37,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,574 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] [2019-11-25 08:52:37,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-25 08:52:37,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670108054] [2019-11-25 08:52:37,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:37,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670108054] [2019-11-25 08:52:37,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:37,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:52:37,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869513675] [2019-11-25 08:52:37,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:37,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:37,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:37,756 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-25 08:52:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,757 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-25 08:52:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:52:38,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-25 08:52:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,881 INFO L225 Difference]: With dead ends: 35069 [2019-11-25 08:52:38,881 INFO L226 Difference]: Without dead ends: 28819 [2019-11-25 08:52:38,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-25 08:52:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-25 08:52:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-25 08:52:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-25 08:52:39,676 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-25 08:52:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:39,676 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-25 08:52:39,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-25 08:52:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 08:52:39,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:39,683 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:39,684 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-25 08:52:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:39,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808677015] [2019-11-25 08:52:39,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,845 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:52:39,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808677015] [2019-11-25 08:52:39,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:52:39,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619618474] [2019-11-25 08:52:39,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:39,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:39,848 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-25 08:52:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:40,266 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-25 08:52:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:52:40,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-25 08:52:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:40,692 INFO L225 Difference]: With dead ends: 31729 [2019-11-25 08:52:40,692 INFO L226 Difference]: Without dead ends: 25345 [2019-11-25 08:52:40,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-25 08:52:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-25 08:52:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-25 08:52:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-25 08:52:41,259 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-25 08:52:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,260 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-25 08:52:41,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-25 08:52:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:52:41,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,265 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:41,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-25 08:52:41,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607018226] [2019-11-25 08:52:41,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:41,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607018226] [2019-11-25 08:52:41,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090218686] [2019-11-25 08:52:41,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:52:41,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:41,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:41,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 08:52:41,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199871345] [2019-11-25 08:52:41,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:52:41,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:52:41,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:52:41,741 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-25 08:52:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,737 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-25 08:52:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:42,737 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-25 08:52:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,844 INFO L225 Difference]: With dead ends: 34675 [2019-11-25 08:52:42,844 INFO L226 Difference]: Without dead ends: 32095 [2019-11-25 08:52:42,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:52:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-25 08:52:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-25 08:52:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-25 08:52:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-25 08:52:43,516 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-25 08:52:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,516 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-25 08:52:43,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:52:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-25 08:52:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:52:43,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,522 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:43,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:43,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-25 08:52:43,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077381884] [2019-11-25 08:52:43,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,872 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:52:43,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077381884] [2019-11-25 08:52:43,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:43,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:43,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186244416] [2019-11-25 08:52:43,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:43,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:43,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:43,875 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-25 08:52:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:44,680 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-25 08:52:44,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:44,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-25 08:52:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:44,766 INFO L225 Difference]: With dead ends: 32695 [2019-11-25 08:52:44,766 INFO L226 Difference]: Without dead ends: 29971 [2019-11-25 08:52:44,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-25 08:52:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-25 08:52:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-25 08:52:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-25 08:52:45,297 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-25 08:52:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:45,297 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-25 08:52:45,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-25 08:52:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:52:45,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:45,306 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:45,307 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:45,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-25 08:52:45,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:45,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758581525] [2019-11-25 08:52:45,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:45,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758581525] [2019-11-25 08:52:45,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:45,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:52:45,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071694553] [2019-11-25 08:52:45,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:45,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:45,418 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-25 08:52:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:45,713 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-25 08:52:45,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:52:45,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-25 08:52:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:45,750 INFO L225 Difference]: With dead ends: 22637 [2019-11-25 08:52:45,750 INFO L226 Difference]: Without dead ends: 16787 [2019-11-25 08:52:45,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-25 08:52:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-25 08:52:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-25 08:52:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-25 08:52:46,102 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-25 08:52:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:46,103 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-25 08:52:46,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-25 08:52:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:46,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:46,119 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:46,119 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-25 08:52:46,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:46,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105075045] [2019-11-25 08:52:46,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:46,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105075045] [2019-11-25 08:52:46,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933359170] [2019-11-25 08:52:46,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:52:46,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:46,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:46,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 08:52:46,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674552495] [2019-11-25 08:52:46,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:52:46,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:52:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:52:46,484 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-25 08:52:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:47,269 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-25 08:52:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:47,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-25 08:52:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:47,305 INFO L225 Difference]: With dead ends: 22447 [2019-11-25 08:52:47,305 INFO L226 Difference]: Without dead ends: 19931 [2019-11-25 08:52:47,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:52:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-25 08:52:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-25 08:52:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-25 08:52:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-25 08:52:47,603 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-25 08:52:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:47,604 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-25 08:52:47,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:52:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-25 08:52:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:47,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:47,623 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:47,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:47,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-25 08:52:47,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:47,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493478248] [2019-11-25 08:52:47,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:47,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493478248] [2019-11-25 08:52:47,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:47,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:47,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558658981] [2019-11-25 08:52:47,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:47,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:47,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:47,935 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-25 08:52:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:48,306 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-25 08:52:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:48,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-25 08:52:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:48,336 INFO L225 Difference]: With dead ends: 20531 [2019-11-25 08:52:48,336 INFO L226 Difference]: Without dead ends: 17621 [2019-11-25 08:52:48,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-25 08:52:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-25 08:52:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-25 08:52:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-25 08:52:48,549 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-25 08:52:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:48,549 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-25 08:52:48,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-25 08:52:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:48,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:48,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:48,561 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-25 08:52:48,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:48,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131933353] [2019-11-25 08:52:48,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:48,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131933353] [2019-11-25 08:52:48,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:48,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:48,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220660996] [2019-11-25 08:52:48,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:48,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:48,673 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-25 08:52:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:49,100 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-25 08:52:49,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:52:49,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-25 08:52:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:49,122 INFO L225 Difference]: With dead ends: 16565 [2019-11-25 08:52:49,122 INFO L226 Difference]: Without dead ends: 13655 [2019-11-25 08:52:49,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:52:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-25 08:52:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-25 08:52:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-25 08:52:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-25 08:52:49,334 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-25 08:52:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:49,334 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-25 08:52:49,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-25 08:52:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:49,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:49,342 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:49,342 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-25 08:52:49,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:49,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597226372] [2019-11-25 08:52:49,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:49,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597226372] [2019-11-25 08:52:49,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:49,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:49,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800935383] [2019-11-25 08:52:49,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:49,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:49,442 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-25 08:52:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:49,868 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-25 08:52:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:52:49,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-25 08:52:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:49,891 INFO L225 Difference]: With dead ends: 14255 [2019-11-25 08:52:49,891 INFO L226 Difference]: Without dead ends: 11219 [2019-11-25 08:52:49,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:52:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-25 08:52:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-25 08:52:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-25 08:52:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-25 08:52:50,041 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-25 08:52:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:50,042 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-25 08:52:50,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-25 08:52:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:50,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:50,053 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:50,053 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-25 08:52:50,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:50,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345100195] [2019-11-25 08:52:50,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:50,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345100195] [2019-11-25 08:52:50,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207583160] [2019-11-25 08:52:50,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:50,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:52:50,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:50,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:50,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:50,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 08:52:50,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636089719] [2019-11-25 08:52:50,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 08:52:50,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:52:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:50,469 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-25 08:52:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:51,230 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-25 08:52:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-25 08:52:51,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-25 08:52:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:51,246 INFO L225 Difference]: With dead ends: 11819 [2019-11-25 08:52:51,246 INFO L226 Difference]: Without dead ends: 10559 [2019-11-25 08:52:51,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 08:52:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-25 08:52:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-25 08:52:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-25 08:52:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-25 08:52:51,464 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-25 08:52:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:51,464 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-25 08:52:51,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 08:52:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-25 08:52:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:51,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:51,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:51,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:51,679 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-25 08:52:51,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:51,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130578798] [2019-11-25 08:52:51,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:51,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130578798] [2019-11-25 08:52:51,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566968981] [2019-11-25 08:52:51,836 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:51,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:52:51,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:52:51,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:52:51,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:52,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:52,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:52,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 08:52:52,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451718473] [2019-11-25 08:52:52,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 08:52:52,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:52:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:52,062 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-25 08:52:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:52,643 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-25 08:52:52,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:52:52,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-25 08:52:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:52,655 INFO L225 Difference]: With dead ends: 10319 [2019-11-25 08:52:52,655 INFO L226 Difference]: Without dead ends: 7997 [2019-11-25 08:52:52,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-25 08:52:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-25 08:52:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-25 08:52:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-25 08:52:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-25 08:52:52,751 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-25 08:52:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:52,752 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-25 08:52:52,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 08:52:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-25 08:52:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:52,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:52,759 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:52,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:52,960 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-25 08:52:52,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:52,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864887137] [2019-11-25 08:52:52,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:53,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864887137] [2019-11-25 08:52:53,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:53,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:53,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492692029] [2019-11-25 08:52:53,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:53,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:53,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:53,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:53,104 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-25 08:52:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:53,430 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-25 08:52:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:53,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:53,439 INFO L225 Difference]: With dead ends: 7757 [2019-11-25 08:52:53,440 INFO L226 Difference]: Without dead ends: 6497 [2019-11-25 08:52:53,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:52:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-25 08:52:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-25 08:52:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-25 08:52:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-25 08:52:53,517 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-25 08:52:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:53,518 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-25 08:52:53,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-25 08:52:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:53,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:53,524 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:53,524 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-25 08:52:53,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:53,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876498127] [2019-11-25 08:52:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:53,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876498127] [2019-11-25 08:52:53,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:53,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:53,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344917126] [2019-11-25 08:52:53,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:53,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:53,648 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-25 08:52:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:53,943 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-25 08:52:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:53,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:53,952 INFO L225 Difference]: With dead ends: 7097 [2019-11-25 08:52:53,952 INFO L226 Difference]: Without dead ends: 5027 [2019-11-25 08:52:53,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:52:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-25 08:52:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-25 08:52:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-25 08:52:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-25 08:52:54,011 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-25 08:52:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:54,011 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-25 08:52:54,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-25 08:52:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:54,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:54,016 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:54,016 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-25 08:52:54,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:54,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168692781] [2019-11-25 08:52:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:54,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168692781] [2019-11-25 08:52:54,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:54,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:54,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718853161] [2019-11-25 08:52:54,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:54,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:54,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:54,131 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-25 08:52:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:54,392 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-25 08:52:54,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:52:54,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:54,398 INFO L225 Difference]: With dead ends: 4787 [2019-11-25 08:52:54,398 INFO L226 Difference]: Without dead ends: 3527 [2019-11-25 08:52:54,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-25 08:52:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-25 08:52:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-25 08:52:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-25 08:52:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-25 08:52:54,448 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-25 08:52:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:54,448 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-25 08:52:54,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-25 08:52:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:54,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:54,453 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:54,453 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-25 08:52:54,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:54,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995790503] [2019-11-25 08:52:54,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:54,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995790503] [2019-11-25 08:52:54,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:54,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:54,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903624087] [2019-11-25 08:52:54,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:54,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:54,562 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-25 08:52:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:54,735 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-25 08:52:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:52:54,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:54,735 INFO L225 Difference]: With dead ends: 3287 [2019-11-25 08:52:54,735 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:52:54,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:52:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:52:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:52:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:52:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:52:54,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-25 08:52:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:54,736 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:52:54,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:52:54,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:52:54,739 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:52:54,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:54 BasicIcfg [2019-11-25 08:52:54,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:54,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:54,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:54,742 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:54,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:31" (3/4) ... [2019-11-25 08:52:54,745 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:52:54,750 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-25 08:52:54,750 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-25 08:52:54,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-25 08:52:54,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:52:54,754 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:52:54,787 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_174afce2-83c3-4558-8866-4576a4446721/bin/uautomizer/witness.graphml [2019-11-25 08:52:54,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:54,789 INFO L168 Benchmark]: Toolchain (without parser) took 24550.89 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -260.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-25 08:52:54,789 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:54,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:54,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.70 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:52:54,791 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:54,791 INFO L168 Benchmark]: RCFGBuilder took 395.69 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:54,791 INFO L168 Benchmark]: TraceAbstraction took 23408.19 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-25 08:52:54,792 INFO L168 Benchmark]: Witness Printer took 45.89 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:54,794 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.20 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 619.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.70 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 26.98 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 395.69 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23408.19 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 45.89 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 23.2s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred 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: 5.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 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...