/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:53:27,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:53:27,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:53:27,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:53:27,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:53:27,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:53:27,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:53:27,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:53:27,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:53:27,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:53:27,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:53:27,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:53:27,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:53:27,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:53:27,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:53:27,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:53:27,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:53:27,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:53:27,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:53:27,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:53:27,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:53:27,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:53:27,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:53:27,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:53:27,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:53:27,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:53:27,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:53:27,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:53:27,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:53:27,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:53:27,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:53:27,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:53:27,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:53:27,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:53:27,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:53:27,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:53:27,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:53:27,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:53:27,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:53:27,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:53:27,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:53:27,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 22:53:27,818 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:53:27,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:53:27,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:53:27,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:53:27,820 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:53:27,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:53:27,820 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:53:27,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:53:27,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:53:27,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:53:27,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:53:27,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:53:27,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:53:27,822 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:53:27,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:53:27,822 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:53:27,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:53:27,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:53:27,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:53:27,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:53:27,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:53:27,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:53:27,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:53:27,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:53:27,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:53:27,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:53:27,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:53:27,825 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:53:27,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:53:28,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:53:28,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:53:28,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:53:28,160 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:53:28,161 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:53:28,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-21 22:53:28,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91f3141a/8ca8483e887d4624881ae95a9f55cb23/FLAGf44b70754 [2020-10-21 22:53:28,820 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:53:28,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-21 22:53:28,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91f3141a/8ca8483e887d4624881ae95a9f55cb23/FLAGf44b70754 [2020-10-21 22:53:29,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91f3141a/8ca8483e887d4624881ae95a9f55cb23 [2020-10-21 22:53:29,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:53:29,096 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:53:29,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:53:29,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:53:29,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:53:29,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:53:29" (1/1) ... [2020-10-21 22:53:29,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2561c30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:29, skipping insertion in model container [2020-10-21 22:53:29,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:53:29" (1/1) ... [2020-10-21 22:53:29,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:53:29,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:53:29,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:53:29,858 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:53:29,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:53:30,016 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:53:30,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30 WrapperNode [2020-10-21 22:53:30,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:53:30,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:53:30,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:53:30,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:53:30,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:53:30,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:53:30,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:53:30,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:53:30,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (1/1) ... [2020-10-21 22:53:30,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:53:30,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:53:30,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:53:30,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:53:30,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (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-21 22:53:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:53:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:53:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:53:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:53:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:53:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:53:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:53:30,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:53:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:53:30,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:53:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 22:53:30,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 22:53:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:53:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:53:30,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:53:30,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:53:30,243 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:53:32,657 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:53:32,657 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:53:32,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:53:32 BoogieIcfgContainer [2020-10-21 22:53:32,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:53:32,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:53:32,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:53:32,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:53:32,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:53:29" (1/3) ... [2020-10-21 22:53:32,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad6c849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:53:32, skipping insertion in model container [2020-10-21 22:53:32,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:53:30" (2/3) ... [2020-10-21 22:53:32,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad6c849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:53:32, skipping insertion in model container [2020-10-21 22:53:32,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:53:32" (3/3) ... [2020-10-21 22:53:32,668 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2020-10-21 22:53:32,680 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:53:32,680 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:53:32,689 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:53:32,690 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:53:32,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,724 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,724 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,736 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,736 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,753 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,757 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,758 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:53:32,760 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:53:32,775 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 22:53:32,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:53:32,797 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:53:32,797 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:53:32,797 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:53:32,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:53:32,797 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:53:32,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:53:32,798 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:53:32,812 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:53:32,813 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 124 transitions, 268 flow [2020-10-21 22:53:32,816 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 124 transitions, 268 flow [2020-10-21 22:53:32,818 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 134 places, 124 transitions, 268 flow [2020-10-21 22:53:32,876 INFO L129 PetriNetUnfolder]: 3/120 cut-off events. [2020-10-21 22:53:32,876 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:53:32,882 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-10-21 22:53:32,887 INFO L116 LiptonReduction]: Number of co-enabled transitions 3126 [2020-10-21 22:53:34,753 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-10-21 22:53:34,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 2, 1] term [2020-10-21 22:53:34,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:53:34,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 22:53:34,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:53:36,243 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 151 DAG size of output: 130 [2020-10-21 22:53:37,627 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-21 22:53:37,986 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-21 22:53:38,457 WARN L193 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-21 22:53:38,690 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-21 22:53:38,705 INFO L131 LiptonReduction]: Checked pairs total: 10527 [2020-10-21 22:53:38,705 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 22:53:38,729 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 38 transitions, 96 flow [2020-10-21 22:53:39,292 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7992 states. [2020-10-21 22:53:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7992 states. [2020-10-21 22:53:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:53:39,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:39,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:53:39,301 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1203914477, now seen corresponding path program 1 times [2020-10-21 22:53:39,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:39,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146537004] [2020-10-21 22:53:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:39,557 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-21 22:53:39,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146537004] [2020-10-21 22:53:39,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:39,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:53:39,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965749995] [2020-10-21 22:53:39,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:53:39,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:39,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:53:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:53:39,581 INFO L87 Difference]: Start difference. First operand 7992 states. Second operand 3 states. [2020-10-21 22:53:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:39,884 INFO L93 Difference]: Finished difference Result 6662 states and 27160 transitions. [2020-10-21 22:53:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:53:39,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:53:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:39,969 INFO L225 Difference]: With dead ends: 6662 [2020-10-21 22:53:39,969 INFO L226 Difference]: Without dead ends: 4862 [2020-10-21 22:53:39,970 INFO L677 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-21 22:53:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-10-21 22:53:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2020-10-21 22:53:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2020-10-21 22:53:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2020-10-21 22:53:40,305 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 5 [2020-10-21 22:53:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:40,305 INFO L481 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2020-10-21 22:53:40,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:53:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2020-10-21 22:53:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:53:40,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:40,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:40,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:53:40,311 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:40,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -890502932, now seen corresponding path program 1 times [2020-10-21 22:53:40,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:40,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582727047] [2020-10-21 22:53:40,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:40,477 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-21 22:53:40,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582727047] [2020-10-21 22:53:40,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:40,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:53:40,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400424869] [2020-10-21 22:53:40,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:53:40,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:40,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:53:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:53:40,481 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 3 states. [2020-10-21 22:53:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:40,527 INFO L93 Difference]: Finished difference Result 3262 states and 11480 transitions. [2020-10-21 22:53:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:53:40,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 22:53:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:40,555 INFO L225 Difference]: With dead ends: 3262 [2020-10-21 22:53:40,556 INFO L226 Difference]: Without dead ends: 3262 [2020-10-21 22:53:40,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 22:53:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-21 22:53:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-21 22:53:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-21 22:53:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 11480 transitions. [2020-10-21 22:53:40,679 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 11480 transitions. Word has length 12 [2020-10-21 22:53:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:40,681 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 11480 transitions. [2020-10-21 22:53:40,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:53:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 11480 transitions. [2020-10-21 22:53:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:53:40,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:40,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:40,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:53:40,688 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -719559994, now seen corresponding path program 1 times [2020-10-21 22:53:40,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:40,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60426579] [2020-10-21 22:53:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:40,828 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-21 22:53:40,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60426579] [2020-10-21 22:53:40,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:40,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:53:40,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939661141] [2020-10-21 22:53:40,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:53:40,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:53:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:53:40,831 INFO L87 Difference]: Start difference. First operand 3262 states and 11480 transitions. Second operand 4 states. [2020-10-21 22:53:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:40,877 INFO L93 Difference]: Finished difference Result 1822 states and 5720 transitions. [2020-10-21 22:53:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:53:40,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 22:53:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:40,891 INFO L225 Difference]: With dead ends: 1822 [2020-10-21 22:53:40,891 INFO L226 Difference]: Without dead ends: 1822 [2020-10-21 22:53:40,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:53:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2020-10-21 22:53:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2020-10-21 22:53:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2020-10-21 22:53:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 5720 transitions. [2020-10-21 22:53:40,946 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 5720 transitions. Word has length 16 [2020-10-21 22:53:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:40,947 INFO L481 AbstractCegarLoop]: Abstraction has 1822 states and 5720 transitions. [2020-10-21 22:53:40,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:53:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 5720 transitions. [2020-10-21 22:53:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:53:40,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:40,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:40,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:53:40,952 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1599237533, now seen corresponding path program 1 times [2020-10-21 22:53:40,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:40,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646352333] [2020-10-21 22:53:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:41,030 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-21 22:53:41,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646352333] [2020-10-21 22:53:41,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:41,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:53:41,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546189034] [2020-10-21 22:53:41,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:53:41,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:53:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:53:41,032 INFO L87 Difference]: Start difference. First operand 1822 states and 5720 transitions. Second operand 5 states. [2020-10-21 22:53:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:41,088 INFO L93 Difference]: Finished difference Result 1338 states and 4268 transitions. [2020-10-21 22:53:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:53:41,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-21 22:53:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:41,098 INFO L225 Difference]: With dead ends: 1338 [2020-10-21 22:53:41,099 INFO L226 Difference]: Without dead ends: 1338 [2020-10-21 22:53:41,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:53:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2020-10-21 22:53:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2020-10-21 22:53:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2020-10-21 22:53:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 4268 transitions. [2020-10-21 22:53:41,155 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 4268 transitions. Word has length 20 [2020-10-21 22:53:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:41,155 INFO L481 AbstractCegarLoop]: Abstraction has 1338 states and 4268 transitions. [2020-10-21 22:53:41,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:53:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 4268 transitions. [2020-10-21 22:53:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 22:53:41,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:41,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:41,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:53:41,160 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1983004924, now seen corresponding path program 1 times [2020-10-21 22:53:41,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:41,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394514844] [2020-10-21 22:53:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:41,345 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-21 22:53:41,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394514844] [2020-10-21 22:53:41,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:41,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:53:41,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762081201] [2020-10-21 22:53:41,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:53:41,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:53:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:53:41,347 INFO L87 Difference]: Start difference. First operand 1338 states and 4268 transitions. Second operand 6 states. [2020-10-21 22:53:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:41,400 INFO L93 Difference]: Finished difference Result 1266 states and 4124 transitions. [2020-10-21 22:53:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:53:41,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-21 22:53:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:41,410 INFO L225 Difference]: With dead ends: 1266 [2020-10-21 22:53:41,410 INFO L226 Difference]: Without dead ends: 1266 [2020-10-21 22:53:41,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:53:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2020-10-21 22:53:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2020-10-21 22:53:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2020-10-21 22:53:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4124 transitions. [2020-10-21 22:53:41,447 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4124 transitions. Word has length 25 [2020-10-21 22:53:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:41,447 INFO L481 AbstractCegarLoop]: Abstraction has 1266 states and 4124 transitions. [2020-10-21 22:53:41,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:53:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4124 transitions. [2020-10-21 22:53:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 22:53:41,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:41,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:41,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:53:41,453 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1921487744, now seen corresponding path program 1 times [2020-10-21 22:53:41,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:41,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012718913] [2020-10-21 22:53:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:41,610 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-21 22:53:41,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012718913] [2020-10-21 22:53:41,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:41,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:53:41,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899214263] [2020-10-21 22:53:41,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:53:41,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:53:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:53:41,612 INFO L87 Difference]: Start difference. First operand 1266 states and 4124 transitions. Second operand 6 states. [2020-10-21 22:53:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:41,699 INFO L93 Difference]: Finished difference Result 1629 states and 5225 transitions. [2020-10-21 22:53:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:53:41,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-10-21 22:53:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:41,710 INFO L225 Difference]: With dead ends: 1629 [2020-10-21 22:53:41,710 INFO L226 Difference]: Without dead ends: 618 [2020-10-21 22:53:41,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:53:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-21 22:53:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2020-10-21 22:53:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-10-21 22:53:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1816 transitions. [2020-10-21 22:53:41,730 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1816 transitions. Word has length 30 [2020-10-21 22:53:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:41,731 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 1816 transitions. [2020-10-21 22:53:41,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:53:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1816 transitions. [2020-10-21 22:53:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 22:53:41,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:41,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:41,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:53:41,734 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1000941246, now seen corresponding path program 2 times [2020-10-21 22:53:41,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:41,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590494751] [2020-10-21 22:53:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:41,946 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-21 22:53:41,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590494751] [2020-10-21 22:53:41,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:41,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 22:53:41,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620993073] [2020-10-21 22:53:41,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 22:53:41,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 22:53:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:53:41,948 INFO L87 Difference]: Start difference. First operand 618 states and 1816 transitions. Second operand 8 states. [2020-10-21 22:53:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:42,114 INFO L93 Difference]: Finished difference Result 837 states and 2449 transitions. [2020-10-21 22:53:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:53:42,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-10-21 22:53:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:42,119 INFO L225 Difference]: With dead ends: 837 [2020-10-21 22:53:42,119 INFO L226 Difference]: Without dead ends: 794 [2020-10-21 22:53:42,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:53:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-10-21 22:53:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 602. [2020-10-21 22:53:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-21 22:53:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1752 transitions. [2020-10-21 22:53:42,139 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1752 transitions. Word has length 30 [2020-10-21 22:53:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:42,140 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1752 transitions. [2020-10-21 22:53:42,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 22:53:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1752 transitions. [2020-10-21 22:53:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 22:53:42,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:42,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:42,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:53:42,143 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1872087440, now seen corresponding path program 3 times [2020-10-21 22:53:42,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:42,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347458134] [2020-10-21 22:53:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:42,417 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-21 22:53:42,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347458134] [2020-10-21 22:53:42,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:42,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 22:53:42,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582485597] [2020-10-21 22:53:42,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 22:53:42,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 22:53:42,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:53:42,420 INFO L87 Difference]: Start difference. First operand 602 states and 1752 transitions. Second operand 9 states. [2020-10-21 22:53:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:42,687 INFO L93 Difference]: Finished difference Result 847 states and 2416 transitions. [2020-10-21 22:53:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 22:53:42,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-21 22:53:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:42,691 INFO L225 Difference]: With dead ends: 847 [2020-10-21 22:53:42,692 INFO L226 Difference]: Without dead ends: 780 [2020-10-21 22:53:42,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-21 22:53:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-21 22:53:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 574. [2020-10-21 22:53:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-10-21 22:53:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1668 transitions. [2020-10-21 22:53:42,709 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1668 transitions. Word has length 30 [2020-10-21 22:53:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:42,710 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 1668 transitions. [2020-10-21 22:53:42,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 22:53:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1668 transitions. [2020-10-21 22:53:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 22:53:42,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:42,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:42,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:53:42,712 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:42,713 INFO L82 PathProgramCache]: Analyzing trace with hash 234942734, now seen corresponding path program 4 times [2020-10-21 22:53:42,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:42,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931776547] [2020-10-21 22:53:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:43,065 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-21 22:53:43,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931776547] [2020-10-21 22:53:43,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:43,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 22:53:43,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346575022] [2020-10-21 22:53:43,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 22:53:43,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 22:53:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:53:43,068 INFO L87 Difference]: Start difference. First operand 574 states and 1668 transitions. Second operand 9 states. [2020-10-21 22:53:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:43,349 INFO L93 Difference]: Finished difference Result 841 states and 2447 transitions. [2020-10-21 22:53:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 22:53:43,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-21 22:53:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:43,353 INFO L225 Difference]: With dead ends: 841 [2020-10-21 22:53:43,353 INFO L226 Difference]: Without dead ends: 734 [2020-10-21 22:53:43,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-10-21 22:53:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2020-10-21 22:53:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 542. [2020-10-21 22:53:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-10-21 22:53:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1548 transitions. [2020-10-21 22:53:43,368 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1548 transitions. Word has length 30 [2020-10-21 22:53:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:43,368 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 1548 transitions. [2020-10-21 22:53:43,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 22:53:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1548 transitions. [2020-10-21 22:53:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 22:53:43,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:43,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:43,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:53:43,372 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash -448461348, now seen corresponding path program 5 times [2020-10-21 22:53:43,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:43,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877494004] [2020-10-21 22:53:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:53:43,896 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-21 22:53:43,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877494004] [2020-10-21 22:53:43,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:53:43,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 22:53:43,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105567590] [2020-10-21 22:53:43,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 22:53:43,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:53:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 22:53:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-21 22:53:43,899 INFO L87 Difference]: Start difference. First operand 542 states and 1548 transitions. Second operand 11 states. [2020-10-21 22:53:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:53:44,153 INFO L93 Difference]: Finished difference Result 653 states and 1839 transitions. [2020-10-21 22:53:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:53:44,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-10-21 22:53:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:53:44,155 INFO L225 Difference]: With dead ends: 653 [2020-10-21 22:53:44,156 INFO L226 Difference]: Without dead ends: 482 [2020-10-21 22:53:44,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-21 22:53:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-21 22:53:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-21 22:53:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-21 22:53:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1386 transitions. [2020-10-21 22:53:44,168 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1386 transitions. Word has length 30 [2020-10-21 22:53:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:53:44,168 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1386 transitions. [2020-10-21 22:53:44,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 22:53:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1386 transitions. [2020-10-21 22:53:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 22:53:44,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:53:44,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:53:44,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:53:44,171 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:53:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:53:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash 940616250, now seen corresponding path program 6 times [2020-10-21 22:53:44,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:53:44,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803524469] [2020-10-21 22:53:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:53:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:53:44,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:53:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:53:44,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:53:44,324 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:53:44,324 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:53:44,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:53:44,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,354 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-10-21 22:53:44,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,365 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-21 22:53:44,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,365 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-21 22:53:44,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,366 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-21 22:53:44,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,366 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-21 22:53:44,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,366 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-21 22:53:44,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,367 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-21 22:53:44,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,368 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-21 22:53:44,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,368 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-21 22:53:44,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,368 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-21 22:53:44,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:53:44,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:53:44,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:53:44 BasicIcfg [2020-10-21 22:53:44,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:53:44,482 INFO L168 Benchmark]: Toolchain (without parser) took 15391.27 ms. Allocated memory was 146.3 MB in the beginning and 434.6 MB in the end (delta: 288.4 MB). Free memory was 100.9 MB in the beginning and 111.2 MB in the end (delta: -10.3 MB). Peak memory consumption was 278.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,483 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 920.63 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.06 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,488 INFO L168 Benchmark]: Boogie Preprocessor took 50.09 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 147.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,489 INFO L168 Benchmark]: RCFGBuilder took 2514.75 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 146.7 MB in the beginning and 123.0 MB in the end (delta: 23.7 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,490 INFO L168 Benchmark]: TraceAbstraction took 11819.07 ms. Allocated memory was 247.5 MB in the beginning and 434.6 MB in the end (delta: 187.2 MB). Free memory was 123.0 MB in the beginning and 111.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 198.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:53:44,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 920.63 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.06 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.09 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 147.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2514.75 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 146.7 MB in the beginning and 123.0 MB in the end (delta: 23.7 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11819.07 ms. Allocated memory was 247.5 MB in the beginning and 434.6 MB in the end (delta: 187.2 MB). Free memory was 123.0 MB in the beginning and 111.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 198.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1630 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 205 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.8s, 134 PlacesBefore, 50 PlacesAfterwards, 124 TransitionsBefore, 38 TransitionsAfterwards, 3126 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 10527 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND TRUE 2 !expression [L17] COND FALSE 2 !(0) [L17] 2 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t148; [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L754] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 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) [L790] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L790] 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) [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L871] 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) [L871] 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) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 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 [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 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 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 330 SDtfs, 597 SDslu, 947 SDs, 0 SdLazy, 384 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7992occurred 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.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 590 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 69081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...