/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 13:02:31,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 13:02:31,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 13:02:31,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 13:02:31,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 13:02:31,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 13:02:31,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 13:02:31,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 13:02:31,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 13:02:31,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 13:02:31,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 13:02:31,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 13:02:31,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 13:02:31,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 13:02:31,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 13:02:31,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 13:02:31,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 13:02:31,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 13:02:31,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 13:02:31,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 13:02:31,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 13:02:31,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 13:02:31,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 13:02:31,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 13:02:31,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 13:02:31,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 13:02:31,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 13:02:31,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 13:02:31,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 13:02:31,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 13:02:31,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 13:02:31,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 13:02:31,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 13:02:31,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 13:02:31,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 13:02:31,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 13:02:31,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 13:02:31,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 13:02:31,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 13:02:31,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 13:02:31,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 13:02:31,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-09 13:02:31,686 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 13:02:31,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 13:02:31,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 13:02:31,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 13:02:31,688 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 13:02:31,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 13:02:31,689 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 13:02:31,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 13:02:31,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 13:02:31,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 13:02:31,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 13:02:31,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 13:02:31,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 13:02:31,692 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 13:02:31,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 13:02:31,693 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 13:02:31,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 13:02:31,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 13:02:31,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 13:02:31,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 13:02:31,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 13:02:31,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 13:02:31,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 13:02:31,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 13:02:31,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 13:02:31,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 13:02:31,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 13:02:31,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 13:02:31,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 13:02:31,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 13:02:31,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 13:02:31,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 13:02:31,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 13:02:31,997 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 13:02:31,997 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 13:02:31,998 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2020-10-09 13:02:32,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d839595d/c69ba65b49db4d938b9f5cbf89ce2929/FLAG77615ad1f [2020-10-09 13:02:32,585 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 13:02:32,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2020-10-09 13:02:32,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d839595d/c69ba65b49db4d938b9f5cbf89ce2929/FLAG77615ad1f [2020-10-09 13:02:32,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d839595d/c69ba65b49db4d938b9f5cbf89ce2929 [2020-10-09 13:02:32,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 13:02:32,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 13:02:32,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 13:02:32,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 13:02:32,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 13:02:32,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:02:32" (1/1) ... [2020-10-09 13:02:32,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99d68b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:32, skipping insertion in model container [2020-10-09 13:02:32,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:02:32" (1/1) ... [2020-10-09 13:02:32,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 13:02:32,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 13:02:33,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:02:33,517 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 13:02:33,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:02:33,662 INFO L208 MainTranslator]: Completed translation [2020-10-09 13:02:33,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33 WrapperNode [2020-10-09 13:02:33,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 13:02:33,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 13:02:33,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 13:02:33,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 13:02:33,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 13:02:33,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 13:02:33,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 13:02:33,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 13:02:33,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (1/1) ... [2020-10-09 13:02:33,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 13:02:33,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 13:02:33,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 13:02:33,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 13:02:33,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (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-09 13:02:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 13:02:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 13:02:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 13:02:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 13:02:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 13:02:33,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 13:02:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 13:02:33,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 13:02:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 13:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 13:02:33,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 13:02:33,852 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 13:02:35,520 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 13:02:35,521 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 13:02:35,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:02:35 BoogieIcfgContainer [2020-10-09 13:02:35,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 13:02:35,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 13:02:35,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 13:02:35,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 13:02:35,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 01:02:32" (1/3) ... [2020-10-09 13:02:35,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa4189b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:02:35, skipping insertion in model container [2020-10-09 13:02:35,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:02:33" (2/3) ... [2020-10-09 13:02:35,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa4189b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:02:35, skipping insertion in model container [2020-10-09 13:02:35,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:02:35" (3/3) ... [2020-10-09 13:02:35,532 INFO L111 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2020-10-09 13:02:35,544 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 13:02:35,545 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 13:02:35,552 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 13:02:35,554 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 13:02:35,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:02:35,630 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-09 13:02:35,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 13:02:35,653 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 13:02:35,653 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 13:02:35,653 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 13:02:35,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 13:02:35,653 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 13:02:35,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 13:02:35,654 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 13:02:35,667 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 13:02:35,670 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-09 13:02:35,673 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-09 13:02:35,675 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-09 13:02:35,715 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-09 13:02:35,715 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 13:02:35,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2020-10-09 13:02:35,722 INFO L117 LiptonReduction]: Number of co-enabled transitions 816 [2020-10-09 13:02:35,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:02:35,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:35,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:35,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:35,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:02:35,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,229 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-09 13:02:36,363 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 13:02:36,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:02:36,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:36,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:36,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:02:36,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:02:36,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:02:36,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:02:36,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 13:02:36,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 13:02:36,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:02:36,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:36,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-09 13:02:36,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:37,166 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 13:02:37,307 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 13:02:37,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:37,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:37,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:37,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:37,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:37,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:02:37,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:37,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:02:37,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:02:37,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:37,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:02:37,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:37,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:37,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:37,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:37,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:38,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:38,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:38,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:38,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:38,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:38,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:38,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:38,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:38,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:38,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:02:38,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:02:38,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:38,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:02:38,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:38,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 13:02:38,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 13:02:38,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:02:38,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:02:38,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:02:38,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:02:38,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:38,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:02:38,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:02:38,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:02:38,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:02:38,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:38,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:02:38,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:02:38,754 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-09 13:02:38,844 INFO L132 LiptonReduction]: Checked pairs total: 1954 [2020-10-09 13:02:38,844 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-09 13:02:38,851 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-10-09 13:02:38,868 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154 states. [2020-10-09 13:02:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2020-10-09 13:02:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-09 13:02:38,877 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:02:38,877 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-09 13:02:38,878 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:02:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:02:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 770968822, now seen corresponding path program 1 times [2020-10-09 13:02:38,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:02:38,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417457504] [2020-10-09 13:02:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:02:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:02:39,134 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-09 13:02:39,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417457504] [2020-10-09 13:02:39,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:02:39,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 13:02:39,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920482701] [2020-10-09 13:02:39,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:02:39,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:02:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:02:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:02:39,160 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2020-10-09 13:02:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:02:39,214 INFO L93 Difference]: Finished difference Result 130 states and 302 transitions. [2020-10-09 13:02:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:02:39,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-09 13:02:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:02:39,228 INFO L225 Difference]: With dead ends: 130 [2020-10-09 13:02:39,228 INFO L226 Difference]: Without dead ends: 110 [2020-10-09 13:02:39,230 INFO L673 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-09 13:02:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-09 13:02:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-09 13:02:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-09 13:02:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 251 transitions. [2020-10-09 13:02:39,281 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 251 transitions. Word has length 5 [2020-10-09 13:02:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:02:39,281 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 251 transitions. [2020-10-09 13:02:39,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:02:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 251 transitions. [2020-10-09 13:02:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-09 13:02:39,283 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:02:39,283 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:02:39,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 13:02:39,284 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:02:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:02:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1551943189, now seen corresponding path program 1 times [2020-10-09 13:02:39,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:02:39,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144235245] [2020-10-09 13:02:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:02:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:02:39,385 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-09 13:02:39,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144235245] [2020-10-09 13:02:39,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:02:39,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:02:39,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52910848] [2020-10-09 13:02:39,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:02:39,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:02:39,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:02:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:02:39,388 INFO L87 Difference]: Start difference. First operand 110 states and 251 transitions. Second operand 4 states. [2020-10-09 13:02:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:02:39,429 INFO L93 Difference]: Finished difference Result 174 states and 367 transitions. [2020-10-09 13:02:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:02:39,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-09 13:02:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:02:39,432 INFO L225 Difference]: With dead ends: 174 [2020-10-09 13:02:39,432 INFO L226 Difference]: Without dead ends: 118 [2020-10-09 13:02:39,433 INFO L673 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-09 13:02:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-09 13:02:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2020-10-09 13:02:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-09 13:02:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 214 transitions. [2020-10-09 13:02:39,446 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 214 transitions. Word has length 8 [2020-10-09 13:02:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:02:39,446 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 214 transitions. [2020-10-09 13:02:39,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:02:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 214 transitions. [2020-10-09 13:02:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 13:02:39,448 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:02:39,448 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:02:39,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 13:02:39,448 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:02:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:02:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1985133872, now seen corresponding path program 1 times [2020-10-09 13:02:39,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:02:39,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575232612] [2020-10-09 13:02:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:02:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:02:39,549 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-09 13:02:39,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575232612] [2020-10-09 13:02:39,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:02:39,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:02:39,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842642618] [2020-10-09 13:02:39,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:02:39,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:02:39,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:02:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:02:39,552 INFO L87 Difference]: Start difference. First operand 100 states and 214 transitions. Second operand 4 states. [2020-10-09 13:02:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:02:39,583 INFO L93 Difference]: Finished difference Result 80 states and 138 transitions. [2020-10-09 13:02:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:02:39,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-09 13:02:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:02:39,585 INFO L225 Difference]: With dead ends: 80 [2020-10-09 13:02:39,585 INFO L226 Difference]: Without dead ends: 60 [2020-10-09 13:02:39,586 INFO L673 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-09 13:02:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-09 13:02:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-09 13:02:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-09 13:02:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 98 transitions. [2020-10-09 13:02:39,592 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 98 transitions. Word has length 9 [2020-10-09 13:02:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:02:39,592 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 98 transitions. [2020-10-09 13:02:39,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:02:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 98 transitions. [2020-10-09 13:02:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 13:02:39,593 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:02:39,593 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:02:39,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 13:02:39,594 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:02:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:02:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2072568270, now seen corresponding path program 1 times [2020-10-09 13:02:39,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:02:39,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961919330] [2020-10-09 13:02:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:02:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:02:39,734 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-09 13:02:39,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961919330] [2020-10-09 13:02:39,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:02:39,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:02:39,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337570700] [2020-10-09 13:02:39,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 13:02:39,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:02:39,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 13:02:39,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 13:02:39,736 INFO L87 Difference]: Start difference. First operand 60 states and 98 transitions. Second operand 5 states. [2020-10-09 13:02:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:02:39,776 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2020-10-09 13:02:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 13:02:39,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-09 13:02:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:02:39,778 INFO L225 Difference]: With dead ends: 42 [2020-10-09 13:02:39,778 INFO L226 Difference]: Without dead ends: 22 [2020-10-09 13:02:39,779 INFO L673 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-09 13:02:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-10-09 13:02:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-09 13:02:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-09 13:02:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-09 13:02:39,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 11 [2020-10-09 13:02:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:02:39,782 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-09 13:02:39,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 13:02:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-10-09 13:02:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 13:02:39,782 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:02:39,782 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:02:39,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 13:02:39,783 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:02:39,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:02:39,783 INFO L82 PathProgramCache]: Analyzing trace with hash 807307870, now seen corresponding path program 1 times [2020-10-09 13:02:39,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:02:39,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651205641] [2020-10-09 13:02:39,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:02:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:02:40,050 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-09 13:02:40,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651205641] [2020-10-09 13:02:40,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:02:40,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 13:02:40,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043049616] [2020-10-09 13:02:40,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 13:02:40,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:02:40,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 13:02:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-09 13:02:40,053 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 10 states. [2020-10-09 13:02:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:02:40,264 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-10-09 13:02:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:02:40,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-09 13:02:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:02:40,265 INFO L225 Difference]: With dead ends: 35 [2020-10-09 13:02:40,265 INFO L226 Difference]: Without dead ends: 19 [2020-10-09 13:02:40,266 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-10-09 13:02:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-10-09 13:02:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-09 13:02:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-09 13:02:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-10-09 13:02:40,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2020-10-09 13:02:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:02:40,269 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-10-09 13:02:40,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 13:02:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-10-09 13:02:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 13:02:40,270 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:02:40,270 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:02:40,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 13:02:40,270 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:02:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:02:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1733042314, now seen corresponding path program 2 times [2020-10-09 13:02:40,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:02:40,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134168034] [2020-10-09 13:02:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:02:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:02:40,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:02:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:02:40,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:02:40,468 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 13:02:40,469 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 13:02:40,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 13:02:40,488 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-09 13:02:40,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,489 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-09 13:02:40,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,490 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-09 13:02:40,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,490 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-09 13:02:40,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,491 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-09 13:02:40,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,491 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-09 13:02:40,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,491 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-09 13:02:40,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,492 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-09 13:02:40,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,492 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-09 13:02:40,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,493 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-09 13:02:40,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,493 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-09 13:02:40,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,493 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-09 13:02:40,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,494 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-09 13:02:40,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,494 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-09 13:02:40,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,495 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-09 13:02:40,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,495 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-09 13:02:40,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,495 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-09 13:02:40,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,496 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-09 13:02:40,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,496 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-09 13:02:40,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,496 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-09 13:02:40,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,497 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-09 13:02:40,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,498 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-09 13:02:40,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,498 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-09 13:02:40,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,498 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-09 13:02:40,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,499 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-09 13:02:40,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:02:40,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 01:02:40 BasicIcfg [2020-10-09 13:02:40,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 13:02:40,542 INFO L168 Benchmark]: Toolchain (without parser) took 7689.74 ms. Allocated memory was 252.7 MB in the beginning and 428.3 MB in the end (delta: 175.6 MB). Free memory was 205.9 MB in the beginning and 216.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 164.9 MB. Max. memory is 14.2 GB. [2020-10-09 13:02:40,543 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 252.7 MB. Free memory is still 226.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:02:40,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.74 ms. Allocated memory was 252.7 MB in the beginning and 319.3 MB in the end (delta: 66.6 MB). Free memory was 205.9 MB in the beginning and 272.1 MB in the end (delta: -66.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:02:40,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.64 ms. Allocated memory is still 319.3 MB. Free memory was 272.1 MB in the beginning and 269.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:02:40,545 INFO L168 Benchmark]: Boogie Preprocessor took 35.46 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:02:40,546 INFO L168 Benchmark]: RCFGBuilder took 1754.13 ms. Allocated memory was 319.3 MB in the beginning and 359.7 MB in the end (delta: 40.4 MB). Free memory was 267.0 MB in the beginning and 243.4 MB in the end (delta: 23.7 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. [2020-10-09 13:02:40,547 INFO L168 Benchmark]: TraceAbstraction took 5015.75 ms. Allocated memory was 359.7 MB in the beginning and 428.3 MB in the end (delta: 68.7 MB). Free memory was 240.1 MB in the beginning and 216.7 MB in the end (delta: 23.4 MB). Peak memory consumption was 92.1 MB. Max. memory is 14.2 GB. [2020-10-09 13:02:40,551 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.20 ms. Allocated memory is still 252.7 MB. Free memory is still 226.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 809.74 ms. Allocated memory was 252.7 MB in the beginning and 319.3 MB in the end (delta: 66.6 MB). Free memory was 205.9 MB in the beginning and 272.1 MB in the end (delta: -66.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.64 ms. Allocated memory is still 319.3 MB. Free memory was 272.1 MB in the beginning and 269.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 35.46 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1754.13 ms. Allocated memory was 319.3 MB in the beginning and 359.7 MB in the end (delta: 40.4 MB). Free memory was 267.0 MB in the beginning and 243.4 MB in the end (delta: 23.7 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5015.75 ms. Allocated memory was 359.7 MB in the beginning and 428.3 MB in the end (delta: 68.7 MB). Free memory was 240.1 MB in the beginning and 216.7 MB in the end (delta: 23.4 MB). Peak memory consumption was 92.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 624 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 72 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.1s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 20 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 1954 MoverChecksTotal - CounterExampleResult [Line: 8]: 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_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L705] 0 _Bool x$flush_delayed; [L706] 0 int x$mem_tmp; [L707] 0 _Bool x$r_buff0_thd0; [L708] 0 _Bool x$r_buff0_thd1; [L709] 0 _Bool x$r_buff0_thd2; [L710] 0 _Bool x$r_buff1_thd0; [L711] 0 _Bool x$r_buff1_thd1; [L712] 0 _Bool x$r_buff1_thd2; [L713] 0 _Bool x$read_delayed; [L714] 0 int *x$read_delayed_var; [L715] 0 int x$w_buff0; [L716] 0 _Bool x$w_buff0_used; [L717] 0 int x$w_buff1; [L718] 0 _Bool x$w_buff1_used; [L720] 0 int y = 0; [L721] 0 _Bool weak$$choice0; [L722] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2567; [L793] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t2568; [L795] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 1 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L732] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L733] 1 x$flush_delayed = weak$$choice2 [L734] 1 x$mem_tmp = x [L735] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L736] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L737] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L738] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L739] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L739] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L740] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L741] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L741] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 __unbuffered_p0_EAX = x [L743] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L743] 1 x = x$flush_delayed ? x$mem_tmp : x [L744] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L4] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 82 SDtfs, 70 SDslu, 147 SDs, 0 SdLazy, 137 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 2885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...