/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:38:48,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:38:48,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:38:49,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:38:49,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:38:49,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:38:49,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:38:49,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:38:49,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:38:49,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:38:49,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:38:49,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:38:49,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:38:49,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:38:49,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:38:49,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:38:49,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:38:49,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:38:49,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:38:49,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:38:49,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:38:49,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:38:49,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:38:49,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:38:49,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:38:49,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:38:49,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:38:49,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:38:49,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:38:49,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:38:49,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:38:49,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:38:49,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:38:49,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:38:49,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:38:49,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:38:49,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:38:49,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:38:49,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:38:49,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:38:49,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:38:49,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:38:49,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:38:49,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:38:49,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:38:49,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:38:49,133 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:38:49,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:38:49,133 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:38:49,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:38:49,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:38:49,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:38:49,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:38:49,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:38:49,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:38:49,136 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:38:49,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:38:49,136 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:38:49,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:38:49,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:38:49,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:38:49,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:38:49,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:38:49,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:38:49,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:38:49,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:38:49,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:38:49,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:38:49,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:38:49,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:38:49,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:38:49,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:38:49,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:38:49,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:38:49,435 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:38:49,436 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:38:49,437 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2020-10-05 23:38:49,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0638c24/b657379d47f94d76a64cba478225d823/FLAG357746ac9 [2020-10-05 23:38:50,124 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:38:50,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2020-10-05 23:38:50,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0638c24/b657379d47f94d76a64cba478225d823/FLAG357746ac9 [2020-10-05 23:38:50,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0638c24/b657379d47f94d76a64cba478225d823 [2020-10-05 23:38:50,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:38:50,369 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:38:50,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:38:50,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:38:50,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:38:50,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:38:50" (1/1) ... [2020-10-05 23:38:50,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6995f0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:50, skipping insertion in model container [2020-10-05 23:38:50,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:38:50" (1/1) ... [2020-10-05 23:38:50,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:38:50,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:38:50,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:38:50,987 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:38:51,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:38:51,135 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:38:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51 WrapperNode [2020-10-05 23:38:51,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:38:51,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:38:51,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:38:51,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:38:51,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:38:51,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:38:51,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:38:51,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:38:51,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... [2020-10-05 23:38:51,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:38:51,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:38:51,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:38:51,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:38:51,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-05 23:38:51,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:38:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:38:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:38:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:38:51,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:38:51,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:38:51,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:38:51,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:38:51,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:38:51,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:38:51,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:38:51,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:38:51,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:38:51,341 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:38:53,419 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:38:53,419 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:38:53,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:38:53 BoogieIcfgContainer [2020-10-05 23:38:53,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:38:53,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:38:53,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:38:53,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:38:53,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:38:50" (1/3) ... [2020-10-05 23:38:53,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f733b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:38:53, skipping insertion in model container [2020-10-05 23:38:53,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:51" (2/3) ... [2020-10-05 23:38:53,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f733b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:38:53, skipping insertion in model container [2020-10-05 23:38:53,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:38:53" (3/3) ... [2020-10-05 23:38:53,430 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.opt.i [2020-10-05 23:38:53,440 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:38:53,440 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:38:53,447 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:38:53,448 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:38:53,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:53,515 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:38:53,536 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:38:53,536 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:38:53,536 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:38:53,537 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:38:53,537 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:38:53,537 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:38:53,537 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:38:53,537 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:38:53,552 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-05 23:38:53,554 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-05 23:38:53,599 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-05 23:38:53,599 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:38:53,604 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:38:53,608 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-05 23:38:53,629 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-05 23:38:53,630 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:38:53,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:38:53,633 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1650 [2020-10-05 23:38:53,634 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:38:54,141 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:38:55,784 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-05 23:38:55,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-05 23:38:55,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:38:55,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:38:55,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:38:57,029 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-05 23:38:57,541 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:38:58,174 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-05 23:38:58,531 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-05 23:38:59,151 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-05 23:38:59,438 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-05 23:39:00,418 WARN L193 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2020-10-05 23:39:00,723 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-05 23:39:01,193 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:39:01,529 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:39:01,856 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-05 23:39:01,973 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:39:01,979 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4399 [2020-10-05 23:39:01,979 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-10-05 23:39:01,983 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:39:02,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-05 23:39:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-05 23:39:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:39:02,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:39:02,087 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1045083, now seen corresponding path program 1 times [2020-10-05 23:39:02,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363761147] [2020-10-05 23:39:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363761147] [2020-10-05 23:39:02,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:02,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410483851] [2020-10-05 23:39:02,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:02,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:02,365 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-05 23:39:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,481 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-05 23:39:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:02,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:39:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,507 INFO L225 Difference]: With dead ends: 687 [2020-10-05 23:39:02,508 INFO L226 Difference]: Without dead ends: 562 [2020-10-05 23:39:02,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-05 23:39:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-05 23:39:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-05 23:39:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-05 23:39:02,624 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-05 23:39:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,624 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-05 23:39:02,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-05 23:39:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:39:02,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:39:02,627 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1897044844, now seen corresponding path program 1 times [2020-10-05 23:39:02,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795565055] [2020-10-05 23:39:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795565055] [2020-10-05 23:39:02,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642803667] [2020-10-05 23:39:02,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:02,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:02,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:02,800 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-05 23:39:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,842 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-05 23:39:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:02,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:39:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,849 INFO L225 Difference]: With dead ends: 557 [2020-10-05 23:39:02,849 INFO L226 Difference]: Without dead ends: 557 [2020-10-05 23:39:02,850 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-05 23:39:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-05 23:39:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-05 23:39:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-05 23:39:02,877 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-05 23:39:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,878 INFO L479 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-05 23:39:02,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-05 23:39:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:39:02,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:39:02,881 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1295466417, now seen corresponding path program 1 times [2020-10-05 23:39:02,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093502252] [2020-10-05 23:39:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093502252] [2020-10-05 23:39:02,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:02,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867111641] [2020-10-05 23:39:02,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:02,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:02,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:02,973 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-05 23:39:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,986 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-05 23:39:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:02,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:39:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,992 INFO L225 Difference]: With dead ends: 537 [2020-10-05 23:39:02,992 INFO L226 Difference]: Without dead ends: 537 [2020-10-05 23:39:02,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-05 23:39:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-05 23:39:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-05 23:39:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-05 23:39:03,012 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 10 [2020-10-05 23:39:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:03,012 INFO L479 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-05 23:39:03,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-05 23:39:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:39:03,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:03,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:03,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:39:03,015 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1294542896, now seen corresponding path program 1 times [2020-10-05 23:39:03,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:03,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226466287] [2020-10-05 23:39:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:03,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226466287] [2020-10-05 23:39:03,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:03,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:39:03,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924216806] [2020-10-05 23:39:03,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:03,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:03,108 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 4 states. [2020-10-05 23:39:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:03,156 INFO L93 Difference]: Finished difference Result 701 states and 2070 transitions. [2020-10-05 23:39:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:03,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 23:39:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:03,160 INFO L225 Difference]: With dead ends: 701 [2020-10-05 23:39:03,161 INFO L226 Difference]: Without dead ends: 361 [2020-10-05 23:39:03,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-10-05 23:39:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2020-10-05 23:39:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-10-05 23:39:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1029 transitions. [2020-10-05 23:39:03,176 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1029 transitions. Word has length 10 [2020-10-05 23:39:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:03,177 INFO L479 AbstractCegarLoop]: Abstraction has 361 states and 1029 transitions. [2020-10-05 23:39:03,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1029 transitions. [2020-10-05 23:39:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:39:03,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:03,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:03,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:39:03,185 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash -11306910, now seen corresponding path program 1 times [2020-10-05 23:39:03,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:03,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624038482] [2020-10-05 23:39:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:03,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624038482] [2020-10-05 23:39:03,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:03,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:03,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455415957] [2020-10-05 23:39:03,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:03,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:03,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:03,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:03,284 INFO L87 Difference]: Start difference. First operand 361 states and 1029 transitions. Second operand 3 states. [2020-10-05 23:39:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:03,299 INFO L93 Difference]: Finished difference Result 349 states and 988 transitions. [2020-10-05 23:39:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:03,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:39:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:03,303 INFO L225 Difference]: With dead ends: 349 [2020-10-05 23:39:03,303 INFO L226 Difference]: Without dead ends: 349 [2020-10-05 23:39:03,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-10-05 23:39:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-10-05 23:39:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-10-05 23:39:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 988 transitions. [2020-10-05 23:39:03,318 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 988 transitions. Word has length 12 [2020-10-05 23:39:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:03,318 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 988 transitions. [2020-10-05 23:39:03,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 988 transitions. [2020-10-05 23:39:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:39:03,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:03,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:03,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:39:03,321 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash -351998039, now seen corresponding path program 1 times [2020-10-05 23:39:03,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:03,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871110162] [2020-10-05 23:39:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:03,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871110162] [2020-10-05 23:39:03,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:03,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:03,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547928727] [2020-10-05 23:39:03,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:03,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:03,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:03,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:03,497 INFO L87 Difference]: Start difference. First operand 349 states and 988 transitions. Second operand 5 states. [2020-10-05 23:39:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:03,639 INFO L93 Difference]: Finished difference Result 445 states and 1244 transitions. [2020-10-05 23:39:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:03,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:39:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:03,642 INFO L225 Difference]: With dead ends: 445 [2020-10-05 23:39:03,643 INFO L226 Difference]: Without dead ends: 241 [2020-10-05 23:39:03,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-10-05 23:39:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-10-05 23:39:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-05 23:39:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 643 transitions. [2020-10-05 23:39:03,654 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 643 transitions. Word has length 13 [2020-10-05 23:39:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:03,655 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 643 transitions. [2020-10-05 23:39:03,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 643 transitions. [2020-10-05 23:39:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:39:03,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:03,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:03,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:39:03,657 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1582676509, now seen corresponding path program 1 times [2020-10-05 23:39:03,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:03,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676082124] [2020-10-05 23:39:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:03,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676082124] [2020-10-05 23:39:03,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:03,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:03,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367799598] [2020-10-05 23:39:03,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:03,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:03,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:03,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:03,795 INFO L87 Difference]: Start difference. First operand 241 states and 643 transitions. Second operand 5 states. [2020-10-05 23:39:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:03,886 INFO L93 Difference]: Finished difference Result 240 states and 639 transitions. [2020-10-05 23:39:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:03,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:39:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:03,891 INFO L225 Difference]: With dead ends: 240 [2020-10-05 23:39:03,891 INFO L226 Difference]: Without dead ends: 240 [2020-10-05 23:39:03,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-10-05 23:39:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2020-10-05 23:39:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-10-05 23:39:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 639 transitions. [2020-10-05 23:39:03,899 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 639 transitions. Word has length 14 [2020-10-05 23:39:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:03,900 INFO L479 AbstractCegarLoop]: Abstraction has 240 states and 639 transitions. [2020-10-05 23:39:03,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 639 transitions. [2020-10-05 23:39:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:39:03,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:03,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:03,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:39:03,901 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash 582330823, now seen corresponding path program 1 times [2020-10-05 23:39:03,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:03,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573439455] [2020-10-05 23:39:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:04,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573439455] [2020-10-05 23:39:04,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:04,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:04,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254919346] [2020-10-05 23:39:04,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:04,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:04,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:04,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:04,016 INFO L87 Difference]: Start difference. First operand 240 states and 639 transitions. Second operand 4 states. [2020-10-05 23:39:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:04,060 INFO L93 Difference]: Finished difference Result 238 states and 565 transitions. [2020-10-05 23:39:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:04,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:39:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:04,062 INFO L225 Difference]: With dead ends: 238 [2020-10-05 23:39:04,062 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:39:04,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:39:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-10-05 23:39:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-05 23:39:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 435 transitions. [2020-10-05 23:39:04,072 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 435 transitions. Word has length 15 [2020-10-05 23:39:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:04,073 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 435 transitions. [2020-10-05 23:39:04,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 435 transitions. [2020-10-05 23:39:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:39:04,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:04,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:04,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:39:04,075 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1622258957, now seen corresponding path program 1 times [2020-10-05 23:39:04,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:04,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254574616] [2020-10-05 23:39:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:04,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254574616] [2020-10-05 23:39:04,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:04,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:39:04,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587327445] [2020-10-05 23:39:04,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:04,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:04,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:04,200 INFO L87 Difference]: Start difference. First operand 185 states and 435 transitions. Second operand 5 states. [2020-10-05 23:39:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:04,253 INFO L93 Difference]: Finished difference Result 156 states and 331 transitions. [2020-10-05 23:39:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:39:04,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:39:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:04,257 INFO L225 Difference]: With dead ends: 156 [2020-10-05 23:39:04,257 INFO L226 Difference]: Without dead ends: 125 [2020-10-05 23:39:04,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-05 23:39:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-05 23:39:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-05 23:39:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 259 transitions. [2020-10-05 23:39:04,262 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 259 transitions. Word has length 16 [2020-10-05 23:39:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:04,263 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 259 transitions. [2020-10-05 23:39:04,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 259 transitions. [2020-10-05 23:39:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:39:04,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:04,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:04,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:39:04,265 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1548015784, now seen corresponding path program 1 times [2020-10-05 23:39:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:04,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611829427] [2020-10-05 23:39:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:04,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611829427] [2020-10-05 23:39:04,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:04,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:39:04,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365693205] [2020-10-05 23:39:04,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:39:04,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:39:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:04,380 INFO L87 Difference]: Start difference. First operand 125 states and 259 transitions. Second operand 6 states. [2020-10-05 23:39:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:04,451 INFO L93 Difference]: Finished difference Result 111 states and 229 transitions. [2020-10-05 23:39:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:39:04,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:39:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:04,454 INFO L225 Difference]: With dead ends: 111 [2020-10-05 23:39:04,454 INFO L226 Difference]: Without dead ends: 102 [2020-10-05 23:39:04,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-05 23:39:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-05 23:39:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-05 23:39:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2020-10-05 23:39:04,459 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 18 [2020-10-05 23:39:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:04,459 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2020-10-05 23:39:04,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:39:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2020-10-05 23:39:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:39:04,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:04,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:04,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:39:04,461 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash 240041931, now seen corresponding path program 1 times [2020-10-05 23:39:04,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:04,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998507349] [2020-10-05 23:39:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:04,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998507349] [2020-10-05 23:39:04,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:04,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:39:04,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739408915] [2020-10-05 23:39:04,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:39:04,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:39:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:39:04,721 INFO L87 Difference]: Start difference. First operand 102 states and 213 transitions. Second operand 8 states. [2020-10-05 23:39:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:04,869 INFO L93 Difference]: Finished difference Result 157 states and 311 transitions. [2020-10-05 23:39:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:39:04,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 23:39:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:04,871 INFO L225 Difference]: With dead ends: 157 [2020-10-05 23:39:04,871 INFO L226 Difference]: Without dead ends: 97 [2020-10-05 23:39:04,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:39:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-05 23:39:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2020-10-05 23:39:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-05 23:39:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 149 transitions. [2020-10-05 23:39:04,874 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 149 transitions. Word has length 21 [2020-10-05 23:39:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:04,875 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 149 transitions. [2020-10-05 23:39:04,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:39:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 149 transitions. [2020-10-05 23:39:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:39:04,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:04,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:04,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:39:04,876 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428939, now seen corresponding path program 2 times [2020-10-05 23:39:04,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:04,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937146164] [2020-10-05 23:39:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:05,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937146164] [2020-10-05 23:39:05,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:05,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:39:05,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131976360] [2020-10-05 23:39:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:39:05,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:39:05,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:05,009 INFO L87 Difference]: Start difference. First operand 78 states and 149 transitions. Second operand 7 states. [2020-10-05 23:39:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:05,108 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2020-10-05 23:39:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:05,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:39:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:05,111 INFO L225 Difference]: With dead ends: 98 [2020-10-05 23:39:05,111 INFO L226 Difference]: Without dead ends: 68 [2020-10-05 23:39:05,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:39:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-05 23:39:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2020-10-05 23:39:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-05 23:39:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-05 23:39:05,117 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2020-10-05 23:39:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:05,117 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-05 23:39:05,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:39:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-05 23:39:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:39:05,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:05,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:05,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:39:05,118 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1230847573, now seen corresponding path program 3 times [2020-10-05 23:39:05,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:05,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793894267] [2020-10-05 23:39:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:39:05,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:39:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:39:05,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:39:05,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:39:05,318 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:39:05,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:39:05,320 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:39:05,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L2-->L825: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In-180648454 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In-180648454 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In-180648454 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-180648454 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (or .cse6 .cse7)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-180648454 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-180648454 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-180648454|) (or (and .cse0 .cse1 (= ~z~0_Out-180648454 ~z$w_buff0~0_In-180648454)) (and (or (and .cse2 (= ~z$w_buff1~0_In-180648454 ~z~0_Out-180648454) .cse3) (and (= ~z~0_In-180648454 ~z~0_Out-180648454) .cse4)) .cse5)) (= ~z$r_buff1_thd0~0_In-180648454 ~z$r_buff1_thd0~0_Out-180648454) (= ~z$r_buff0_thd0~0_In-180648454 ~z$r_buff0_thd0~0_Out-180648454) (or (and (= ~z$w_buff0_used~0_Out-180648454 ~z$w_buff0_used~0_In-180648454) .cse5) (and .cse0 .cse1 (= ~z$w_buff0_used~0_Out-180648454 0))) (or (and .cse4 (= ~z$w_buff1_used~0_Out-180648454 ~z$w_buff1_used~0_In-180648454)) (and .cse2 (= ~z$w_buff1_used~0_Out-180648454 0) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-180648454|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-180648454, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-180648454, ~z$w_buff0~0=~z$w_buff0~0_In-180648454, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-180648454, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-180648454, ~z$w_buff1~0=~z$w_buff1~0_In-180648454, ~z~0=~z~0_In-180648454} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-180648454|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-180648454, ~z$w_buff0~0=~z$w_buff0~0_In-180648454, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-180648454, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-180648454|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-180648454|, ~z$w_buff1~0=~z$w_buff1~0_In-180648454, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-180648454|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-180648454|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-180648454|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-180648454|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-180648454, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-180648454, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-180648454, ~z~0=~z~0_Out-180648454} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:39:05,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:05,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:05,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:39:05 BasicIcfg [2020-10-05 23:39:05,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:39:05,498 INFO L168 Benchmark]: Toolchain (without parser) took 15125.83 ms. Allocated memory was 142.1 MB in the beginning and 382.2 MB in the end (delta: 240.1 MB). Free memory was 102.2 MB in the beginning and 320.0 MB in the end (delta: -217.7 MB). Peak memory consumption was 220.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,499 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 142.1 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.63 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 102.0 MB in the beginning and 158.5 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.82 ms. Allocated memory is still 205.5 MB. Free memory was 158.5 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,502 INFO L168 Benchmark]: Boogie Preprocessor took 46.56 ms. Allocated memory is still 205.5 MB. Free memory was 155.9 MB in the beginning and 153.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,506 INFO L168 Benchmark]: RCFGBuilder took 2157.26 ms. Allocated memory was 205.5 MB in the beginning and 244.3 MB in the end (delta: 38.8 MB). Free memory was 153.4 MB in the beginning and 151.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,509 INFO L168 Benchmark]: TraceAbstraction took 12070.02 ms. Allocated memory was 244.3 MB in the beginning and 382.2 MB in the end (delta: 137.9 MB). Free memory was 149.9 MB in the beginning and 320.0 MB in the end (delta: -170.0 MB). Peak memory consumption was 165.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:05,516 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 142.1 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.63 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 102.0 MB in the beginning and 158.5 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.82 ms. Allocated memory is still 205.5 MB. Free memory was 158.5 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.56 ms. Allocated memory is still 205.5 MB. Free memory was 155.9 MB in the beginning and 153.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2157.26 ms. Allocated memory was 205.5 MB in the beginning and 244.3 MB in the end (delta: 38.8 MB). Free memory was 153.4 MB in the beginning and 151.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12070.02 ms. Allocated memory was 244.3 MB in the beginning and 382.2 MB in the end (delta: 137.9 MB). Free memory was 149.9 MB in the beginning and 320.0 MB in the end (delta: -170.0 MB). Peak memory consumption was 165.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.4s, 101 ProgramPointsBefore, 36 ProgramPointsAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 853 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4399 CheckedPairsTotal, 76 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L710] 0 int z = 0; [L711] 0 _Bool z$flush_delayed; [L712] 0 int z$mem_tmp; [L713] 0 _Bool z$r_buff0_thd0; [L714] 0 _Bool z$r_buff0_thd1; [L715] 0 _Bool z$r_buff0_thd2; [L716] 0 _Bool z$r_buff0_thd3; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$r_buff1_thd3; [L721] 0 _Bool z$read_delayed; [L722] 0 int *z$read_delayed_var; [L723] 0 int z$w_buff0; [L724] 0 _Bool z$w_buff0_used; [L725] 0 int z$w_buff1; [L726] 0 _Bool z$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1976; [L810] FCALL, FORK 0 pthread_create(&t1976, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t1977; [L812] FCALL, FORK 0 pthread_create(&t1977, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 pthread_t t1978; [L732] 1 z$w_buff1 = z$w_buff0 [L733] 1 z$w_buff0 = 2 [L734] 1 z$w_buff1_used = z$w_buff0_used [L735] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L741] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L814] FCALL, FORK 0 pthread_create(&t1978, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 z$flush_delayed = weak$$choice2 [L830] 0 z$mem_tmp = z [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L831] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L833] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L834] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L839] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L839] 0 z = z$flush_delayed ? z$mem_tmp : z [L840] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 249 SDtfs, 274 SDslu, 447 SDs, 0 SdLazy, 263 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 19670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...