/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/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:33:28,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:33:28,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:33:28,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:33:28,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:33:28,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:33:28,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:33:28,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:33:28,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:33:28,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:33:28,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:33:28,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:33:28,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:33:28,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:33:28,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:33:28,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:33:28,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:33:28,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:33:28,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:33:28,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:33:28,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:33:28,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:33:28,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:33:28,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:33:28,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:33:28,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:33:28,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:33:28,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:33:28,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:33:28,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:33:28,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:33:28,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:33:28,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:33:28,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:33:28,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:33:28,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:33:28,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:33:28,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:33:28,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:33:28,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:33:28,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:33:28,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:33:28,624 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:33:28,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:33:28,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:33:28,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:33:28,628 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:33:28,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:33:28,629 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:33:28,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:33:28,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:33:28,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:33:28,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:33:28,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:33:28,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:33:28,632 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:33:28,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:33:28,632 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:33:28,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:33:28,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:33:28,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:33:28,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:33:28,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:33:28,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:33:28,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:33:28,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:33:28,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:33:28,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:33:28,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:33:28,635 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:33:28,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:33:28,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:33:28,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:33:28,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:33:28,987 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:33:28,987 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:33:28,988 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2020-10-05 23:33:29,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccb399ce/c8256e9faeba446e8f5cc296da145969/FLAG90b39a809 [2020-10-05 23:33:29,620 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:33:29,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2020-10-05 23:33:29,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccb399ce/c8256e9faeba446e8f5cc296da145969/FLAG90b39a809 [2020-10-05 23:33:29,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccb399ce/c8256e9faeba446e8f5cc296da145969 [2020-10-05 23:33:29,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:33:29,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:33:29,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:33:29,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:33:29,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:33:29,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:33:29" (1/1) ... [2020-10-05 23:33:29,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a1cbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:29, skipping insertion in model container [2020-10-05 23:33:29,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:33:29" (1/1) ... [2020-10-05 23:33:29,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:33:29,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:33:30,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:33:30,467 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:33:30,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:33:30,636 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:33:30,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30 WrapperNode [2020-10-05 23:33:30,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:33:30,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:33:30,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:33:30,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:33:30,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:33:30,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:33:30,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:33:30,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:33:30,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (1/1) ... [2020-10-05 23:33:30,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:33:30,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:33:30,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:33:30,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:33:30,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33: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-05 23:33:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:33:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:33:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:33:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:33:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:33:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:33:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:33:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:33:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:33:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:33:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:33:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:33:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:33:30,829 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:33:32,858 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:33:32,859 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:33:32,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:33:32 BoogieIcfgContainer [2020-10-05 23:33:32,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:33:32,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:33:32,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:33:32,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:33:32,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:33:29" (1/3) ... [2020-10-05 23:33:32,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430548e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:33:32, skipping insertion in model container [2020-10-05 23:33:32,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:33:30" (2/3) ... [2020-10-05 23:33:32,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430548e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:33:32, skipping insertion in model container [2020-10-05 23:33:32,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:33:32" (3/3) ... [2020-10-05 23:33:32,874 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2020-10-05 23:33:32,884 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:33:32,884 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:33:32,893 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:33:32,894 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:33:32,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,949 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,962 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,962 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,972 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,972 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:33:32,989 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:33:33,012 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:33:33,012 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:33:33,013 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:33:33,013 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:33:33,013 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:33:33,014 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:33:33,014 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:33:33,014 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:33:33,034 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow [2020-10-05 23:33:33,036 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-05 23:33:33,089 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-05 23:33:33,089 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:33:33,094 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 23:33:33,098 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-05 23:33:33,122 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-05 23:33:33,123 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:33:33,124 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 23:33:33,126 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1692 [2020-10-05 23:33:33,127 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:33:33,427 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-10-05 23:33:34,699 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-05 23:33:34,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:33:34,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:33:34,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:33:34,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:33:36,008 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-05 23:33:36,663 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:33:36,821 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:33:38,361 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-05 23:33:38,724 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-05 23:33:39,390 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-05 23:33:39,707 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-05 23:33:40,173 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-05 23:33:40,484 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-05 23:33:40,955 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:33:41,266 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:33:41,732 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-05 23:33:41,868 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-05 23:33:41,876 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4134 [2020-10-05 23:33:41,876 INFO L214 etLargeBlockEncoding]: Total number of compositions: 79 [2020-10-05 23:33:41,880 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:33:41,930 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-05 23:33:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-05 23:33:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:33:41,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:41,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:41,941 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:41,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash 809404757, now seen corresponding path program 1 times [2020-10-05 23:33:41,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:41,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389891812] [2020-10-05 23:33:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:42,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389891812] [2020-10-05 23:33:42,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:42,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:33:42,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945126454] [2020-10-05 23:33:42,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:33:42,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:33:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:33:42,247 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-05 23:33:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:42,362 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-05 23:33:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:33:42,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:33:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:42,397 INFO L225 Difference]: With dead ends: 650 [2020-10-05 23:33:42,397 INFO L226 Difference]: Without dead ends: 530 [2020-10-05 23:33:42,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:33:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-05 23:33:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-05 23:33:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-05 23:33:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-05 23:33:42,504 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-05 23:33:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:42,505 INFO L479 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-05 23:33:42,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:33:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-05 23:33:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:33:42,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:42,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:42,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:33:42,508 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash 448965576, now seen corresponding path program 1 times [2020-10-05 23:33:42,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:42,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704868948] [2020-10-05 23:33:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:42,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704868948] [2020-10-05 23:33:42,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:42,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:33:42,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150078931] [2020-10-05 23:33:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:33:42,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:33:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:33:42,650 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-05 23:33:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:42,665 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-10-05 23:33:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:33:42,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:33:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:42,670 INFO L225 Difference]: With dead ends: 490 [2020-10-05 23:33:42,671 INFO L226 Difference]: Without dead ends: 490 [2020-10-05 23:33:42,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:33:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-05 23:33:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-10-05 23:33:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-10-05 23:33:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-10-05 23:33:42,697 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2020-10-05 23:33:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:42,698 INFO L479 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-10-05 23:33:42,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:33:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-10-05 23:33:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:33:42,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:42,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:42,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:33:42,701 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1959199906, now seen corresponding path program 1 times [2020-10-05 23:33:42,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:42,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357263206] [2020-10-05 23:33:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:42,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357263206] [2020-10-05 23:33:42,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:42,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:42,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930125435] [2020-10-05 23:33:42,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:33:42,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:42,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:33:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:42,846 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 5 states. [2020-10-05 23:33:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:42,916 INFO L93 Difference]: Finished difference Result 466 states and 1390 transitions. [2020-10-05 23:33:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:42,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-05 23:33:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:42,921 INFO L225 Difference]: With dead ends: 466 [2020-10-05 23:33:42,922 INFO L226 Difference]: Without dead ends: 466 [2020-10-05 23:33:42,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-05 23:33:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-10-05 23:33:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2020-10-05 23:33:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-10-05 23:33:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1390 transitions. [2020-10-05 23:33:42,941 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1390 transitions. Word has length 11 [2020-10-05 23:33:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:42,941 INFO L479 AbstractCegarLoop]: Abstraction has 466 states and 1390 transitions. [2020-10-05 23:33:42,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:33:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1390 transitions. [2020-10-05 23:33:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:33:42,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:42,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:42,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:33:42,945 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1595390273, now seen corresponding path program 1 times [2020-10-05 23:33:42,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:42,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850664729] [2020-10-05 23:33:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:43,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850664729] [2020-10-05 23:33:43,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:43,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:43,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951467323] [2020-10-05 23:33:43,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:33:43,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:33:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:33:43,048 INFO L87 Difference]: Start difference. First operand 466 states and 1390 transitions. Second operand 4 states. [2020-10-05 23:33:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:43,089 INFO L93 Difference]: Finished difference Result 448 states and 1184 transitions. [2020-10-05 23:33:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:33:43,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:33:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:43,092 INFO L225 Difference]: With dead ends: 448 [2020-10-05 23:33:43,092 INFO L226 Difference]: Without dead ends: 328 [2020-10-05 23:33:43,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-10-05 23:33:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2020-10-05 23:33:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-10-05 23:33:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 838 transitions. [2020-10-05 23:33:43,103 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 838 transitions. Word has length 13 [2020-10-05 23:33:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:43,103 INFO L479 AbstractCegarLoop]: Abstraction has 328 states and 838 transitions. [2020-10-05 23:33:43,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:33:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 838 transitions. [2020-10-05 23:33:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:33:43,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:43,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:43,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:33:43,105 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1177042995, now seen corresponding path program 1 times [2020-10-05 23:33:43,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:43,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253035907] [2020-10-05 23:33:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:43,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253035907] [2020-10-05 23:33:43,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:43,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:33:43,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127270539] [2020-10-05 23:33:43,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:33:43,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:33:43,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:43,220 INFO L87 Difference]: Start difference. First operand 328 states and 838 transitions. Second operand 5 states. [2020-10-05 23:33:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:43,276 INFO L93 Difference]: Finished difference Result 267 states and 628 transitions. [2020-10-05 23:33:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:33:43,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:33:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:43,278 INFO L225 Difference]: With dead ends: 267 [2020-10-05 23:33:43,278 INFO L226 Difference]: Without dead ends: 207 [2020-10-05 23:33:43,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-10-05 23:33:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2020-10-05 23:33:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-10-05 23:33:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 475 transitions. [2020-10-05 23:33:43,286 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 475 transitions. Word has length 14 [2020-10-05 23:33:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:43,286 INFO L479 AbstractCegarLoop]: Abstraction has 207 states and 475 transitions. [2020-10-05 23:33:43,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:33:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2020-10-05 23:33:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:33:43,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:43,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:43,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:33:43,288 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1466680104, now seen corresponding path program 1 times [2020-10-05 23:33:43,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:43,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964431834] [2020-10-05 23:33:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:43,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964431834] [2020-10-05 23:33:43,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:43,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:33:43,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980293070] [2020-10-05 23:33:43,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:33:43,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:43,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:33:43,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:43,444 INFO L87 Difference]: Start difference. First operand 207 states and 475 transitions. Second operand 6 states. [2020-10-05 23:33:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:43,521 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-10-05 23:33:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:33:43,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:33:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:43,523 INFO L225 Difference]: With dead ends: 186 [2020-10-05 23:33:43,523 INFO L226 Difference]: Without dead ends: 173 [2020-10-05 23:33:43,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:33:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-05 23:33:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-05 23:33:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-05 23:33:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-05 23:33:43,530 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 17 [2020-10-05 23:33:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:43,530 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-05 23:33:43,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:33:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-05 23:33:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:33:43,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:43,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:43,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:33:43,532 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1124172184, now seen corresponding path program 1 times [2020-10-05 23:33:43,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:43,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062883778] [2020-10-05 23:33:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:43,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062883778] [2020-10-05 23:33:43,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:43,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:33:43,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271236881] [2020-10-05 23:33:43,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:33:43,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:33:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:33:43,672 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 6 states. [2020-10-05 23:33:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:43,761 INFO L93 Difference]: Finished difference Result 298 states and 678 transitions. [2020-10-05 23:33:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:33:43,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:33:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:43,763 INFO L225 Difference]: With dead ends: 298 [2020-10-05 23:33:43,764 INFO L226 Difference]: Without dead ends: 216 [2020-10-05 23:33:43,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:33:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-05 23:33:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 173. [2020-10-05 23:33:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-05 23:33:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 399 transitions. [2020-10-05 23:33:43,770 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 399 transitions. Word has length 21 [2020-10-05 23:33:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:43,771 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 399 transitions. [2020-10-05 23:33:43,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:33:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 399 transitions. [2020-10-05 23:33:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:33:43,772 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:43,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:43,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:33:43,772 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash -711670824, now seen corresponding path program 2 times [2020-10-05 23:33:43,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:43,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837728585] [2020-10-05 23:33:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:43,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837728585] [2020-10-05 23:33:43,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:43,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:33:43,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092499017] [2020-10-05 23:33:43,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:33:43,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:43,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:33:43,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:33:43,840 INFO L87 Difference]: Start difference. First operand 173 states and 399 transitions. Second operand 4 states. [2020-10-05 23:33:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:43,861 INFO L93 Difference]: Finished difference Result 239 states and 537 transitions. [2020-10-05 23:33:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:33:43,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-05 23:33:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:43,863 INFO L225 Difference]: With dead ends: 239 [2020-10-05 23:33:43,864 INFO L226 Difference]: Without dead ends: 109 [2020-10-05 23:33:43,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:33:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-05 23:33:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-05 23:33:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-05 23:33:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 223 transitions. [2020-10-05 23:33:43,867 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 223 transitions. Word has length 21 [2020-10-05 23:33:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:43,868 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 223 transitions. [2020-10-05 23:33:43,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:33:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 223 transitions. [2020-10-05 23:33:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:33:43,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:43,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:43,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:33:43,869 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -703904360, now seen corresponding path program 3 times [2020-10-05 23:33:43,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:43,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691838842] [2020-10-05 23:33:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:33:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:33:44,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691838842] [2020-10-05 23:33:44,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:33:44,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:33:44,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099799867] [2020-10-05 23:33:44,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:33:44,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:33:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:33:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:33:44,014 INFO L87 Difference]: Start difference. First operand 109 states and 223 transitions. Second operand 7 states. [2020-10-05 23:33:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:33:44,115 INFO L93 Difference]: Finished difference Result 123 states and 245 transitions. [2020-10-05 23:33:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:33:44,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:33:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:33:44,119 INFO L225 Difference]: With dead ends: 123 [2020-10-05 23:33:44,119 INFO L226 Difference]: Without dead ends: 97 [2020-10-05 23:33:44,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:33:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-05 23:33:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-05 23:33:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-05 23:33:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 195 transitions. [2020-10-05 23:33:44,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 195 transitions. Word has length 21 [2020-10-05 23:33:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:33:44,125 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 195 transitions. [2020-10-05 23:33:44,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:33:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 195 transitions. [2020-10-05 23:33:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:33:44,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:33:44,126 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:33:44,126 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:33:44,126 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:33:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:33:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1796278554, now seen corresponding path program 4 times [2020-10-05 23:33:44,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:33:44,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893891011] [2020-10-05 23:33:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:33:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:33:44,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:33:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:33:44,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:33:44,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:33:44,349 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:33:44,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:33:44,350 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:33:44,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L3-->L830: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In700134354 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In700134354 256) 0)) (.cse9 (= 0 (mod ~y$r_buff0_thd0~0_In700134354 256))) (.cse8 (= (mod ~y$w_buff0_used~0_In700134354 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse0 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~y$r_buff0_thd0~0_Out700134354 ~y$r_buff0_thd0~0_In700134354) (or (and .cse0 (= ~y$w_buff1_used~0_In700134354 ~y$w_buff1_used~0_Out700134354)) (and (= ~y$w_buff1_used~0_Out700134354 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In700134354 0)) (or (and (= ~y$w_buff0_used~0_In700134354 ~y$w_buff0_used~0_Out700134354) .cse3) (and (= ~y$w_buff0_used~0_Out700134354 0) .cse4 .cse5)) (or (and (= ~y$w_buff0~0_In700134354 ~y~0_Out700134354) .cse4 .cse5) (and .cse3 (or (and .cse0 (= ~y~0_Out700134354 ~y~0_In700134354)) (and (= ~y~0_Out700134354 ~y$w_buff1~0_In700134354) .cse1 .cse2)))) (= ~y$r_buff1_thd0~0_Out700134354 ~y$r_buff1_thd0~0_In700134354)))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In700134354, ~y$w_buff0_used~0=~y$w_buff0_used~0_In700134354, ~y$w_buff1~0=~y$w_buff1~0_In700134354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In700134354, ~y$w_buff0~0=~y$w_buff0~0_In700134354, ~y~0=~y~0_In700134354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In700134354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In700134354} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out700134354, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out700134354|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out700134354|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out700134354|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out700134354|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out700134354|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out700134354|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In700134354, ~y$w_buff1~0=~y$w_buff1~0_In700134354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out700134354, ~y$w_buff0~0=~y$w_buff0~0_In700134354, ~y~0=~y~0_Out700134354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out700134354, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out700134354} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:33: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-05 23:33:44,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33: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-05 23:33:44,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:33:44,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:33:44,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:33:44 BasicIcfg [2020-10-05 23:33:44,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:33:44,442 INFO L168 Benchmark]: Toolchain (without parser) took 14556.03 ms. Allocated memory was 146.8 MB in the beginning and 346.0 MB in the end (delta: 199.2 MB). Free memory was 99.8 MB in the beginning and 286.1 MB in the end (delta: -186.3 MB). Peak memory consumption was 216.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,443 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.02 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 99.6 MB in the beginning and 156.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.76 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,445 INFO L168 Benchmark]: Boogie Preprocessor took 39.73 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,446 INFO L168 Benchmark]: RCFGBuilder took 2115.34 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 150.8 MB in the beginning and 193.5 MB in the end (delta: -42.7 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,447 INFO L168 Benchmark]: TraceAbstraction took 11577.21 ms. Allocated memory was 248.0 MB in the beginning and 346.0 MB in the end (delta: 98.0 MB). Free memory was 193.5 MB in the beginning and 286.1 MB in the end (delta: -92.6 MB). Peak memory consumption was 208.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:33:44,451 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.02 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 99.6 MB in the beginning and 156.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.76 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.73 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2115.34 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 150.8 MB in the beginning and 193.5 MB in the end (delta: -42.7 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11577.21 ms. Allocated memory was 248.0 MB in the beginning and 346.0 MB in the end (delta: 98.0 MB). Free memory was 193.5 MB in the beginning and 286.1 MB in the end (delta: -92.6 MB). Peak memory consumption was 208.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.8s, 104 ProgramPointsBefore, 36 ProgramPointsAfterwards, 96 TransitionsBefore, 26 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 910 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4134 CheckedPairsTotal, 79 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L713] 0 _Bool y$flush_delayed; [L714] 0 int y$mem_tmp; [L715] 0 _Bool y$r_buff0_thd0; [L716] 0 _Bool y$r_buff0_thd1; [L717] 0 _Bool y$r_buff0_thd2; [L718] 0 _Bool y$r_buff0_thd3; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L814] 0 pthread_t t1126; [L815] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1127; [L817] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 0 pthread_t t1128; [L819] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 2 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L780] 3 y$r_buff0_thd3 = (_Bool)1 [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L751] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 y$flush_delayed = weak$$choice2 [L835] 0 y$mem_tmp = y [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L844] 0 y = y$flush_delayed ? y$mem_tmp : y [L845] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 228 SDtfs, 251 SDslu, 374 SDs, 0 SdLazy, 184 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 43 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 12867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...