/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/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:04:54,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:04:54,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:04:54,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:04:54,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:04:54,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:04:54,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:04:54,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:04:54,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:04:54,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:04:54,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:04:54,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:04:54,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:04:54,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:04:54,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:04:54,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:04:54,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:04:54,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:04:54,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:04:54,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:04:54,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:04:54,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:04:54,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:04:54,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:04:54,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:04:54,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:04:54,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:04:54,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:04:54,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:04:54,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:04:54,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:04:54,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:04:54,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:04:54,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:04:54,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:04:54,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:04:54,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:04:54,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:04:54,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:04:54,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:04:54,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:04:54,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:04:54,589 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:04:54,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:04:54,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:04:54,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:04:54,593 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:04:54,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:04:54,594 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:04:54,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:04:54,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:04:54,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:04:54,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:04:54,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:04:54,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:04:54,596 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:04:54,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:04:54,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:04:54,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:04:54,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:04:54,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:04:54,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:04:54,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:04:54,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:54,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:04:54,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:04:54,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:04:54,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:04:54,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:04:54,600 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:04:54,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:04:54,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:04:54,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:04:54,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:04:54,907 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:04:54,908 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:04:54,909 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2020-10-16 12:04:54,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e01d31783/19b8b2a3e09f441aa04299fd3ff29a35/FLAG45064d696 [2020-10-16 12:04:55,599 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:04:55,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2020-10-16 12:04:55,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e01d31783/19b8b2a3e09f441aa04299fd3ff29a35/FLAG45064d696 [2020-10-16 12:04:55,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e01d31783/19b8b2a3e09f441aa04299fd3ff29a35 [2020-10-16 12:04:55,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:04:55,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:04:55,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:55,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:04:55,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:04:55,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:55" (1/1) ... [2020-10-16 12:04:55,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b910bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:55, skipping insertion in model container [2020-10-16 12:04:55,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:55" (1/1) ... [2020-10-16 12:04:55,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:04:55,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:04:56,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:56,448 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:04:56,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:56,616 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:04:56,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56 WrapperNode [2020-10-16 12:04:56,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:56,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:56,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:04:56,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:04:56,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:56,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:04:56,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:04:56,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:04:56,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... [2020-10-16 12:04:56,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:04:56,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:04:56,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:04:56,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:04:56,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:04:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:04:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:04:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:04:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:04:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:04:56,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:04:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:04:56,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:04:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:04:56,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:04:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:04:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:04:56,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:04:56,812 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:04:58,913 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:04:58,914 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:04:58,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:58 BoogieIcfgContainer [2020-10-16 12:04:58,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:04:58,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:04:58,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:04:58,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:04:58,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:55" (1/3) ... [2020-10-16 12:04:58,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea798b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:58, skipping insertion in model container [2020-10-16 12:04:58,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:56" (2/3) ... [2020-10-16 12:04:58,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea798b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:58, skipping insertion in model container [2020-10-16 12:04:58,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:58" (3/3) ... [2020-10-16 12:04:58,925 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2020-10-16 12:04:58,939 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:04:58,940 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:04:58,949 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:04:58,950 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:04:58,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,988 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,988 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,989 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,989 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,996 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,996 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:58,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,006 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:59,010 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:04:59,026 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:04:59,049 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:04:59,050 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:04:59,050 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:04:59,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:04:59,050 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:04:59,050 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:04:59,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:04:59,051 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:04:59,066 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:04:59,067 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:04:59,070 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:04:59,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 12:04:59,120 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 12:04:59,120 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:04:59,125 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 12:04:59,129 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 12:04:59,658 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:04:59,789 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:05:00,601 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:05:02,070 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 12:05:02,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 12:05:02,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:02,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:05:02,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:02,843 WARN L193 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2020-10-16 12:05:03,886 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 12:05:03,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 12:05:03,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:03,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:05:03,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:04,959 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 12:05:06,966 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 12:05:06,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:05:06,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:06,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:05:06,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:08,510 WARN L193 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 12:05:08,785 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:05:08,892 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:05:08,901 INFO L132 LiptonReduction]: Checked pairs total: 4174 [2020-10-16 12:05:08,901 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 12:05:08,908 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 12:05:08,956 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 12:05:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 12:05:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:05:08,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:08,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:08,973 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1913445642, now seen corresponding path program 1 times [2020-10-16 12:05:08,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:08,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146508317] [2020-10-16 12:05:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:09,251 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-16 12:05:09,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146508317] [2020-10-16 12:05:09,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:09,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:09,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729840061] [2020-10-16 12:05:09,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:09,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:09,271 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 12:05:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:09,377 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 12:05:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:09,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:05:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:09,405 INFO L225 Difference]: With dead ends: 550 [2020-10-16 12:05:09,405 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 12:05:09,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 12:05:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 12:05:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 12:05:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 12:05:09,530 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 12:05:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:09,532 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 12:05:09,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 12:05:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:05:09,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:09,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:09,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:05:09,534 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash 575294358, now seen corresponding path program 1 times [2020-10-16 12:05:09,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:09,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583154688] [2020-10-16 12:05:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:09,662 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-16 12:05:09,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583154688] [2020-10-16 12:05:09,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:09,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:09,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710358487] [2020-10-16 12:05:09,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:09,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:09,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:09,666 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 12:05:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:09,681 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 12:05:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:09,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:05:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:09,688 INFO L225 Difference]: With dead ends: 440 [2020-10-16 12:05:09,688 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 12:05:09,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 12:05:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 12:05:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 12:05:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 12:05:09,715 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 12:05:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:09,716 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 12:05:09,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 12:05:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:05:09,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:09,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:09,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:05:09,718 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:09,718 INFO L82 PathProgramCache]: Analyzing trace with hash 654255379, now seen corresponding path program 1 times [2020-10-16 12:05:09,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:09,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865244648] [2020-10-16 12:05:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:09,893 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-16 12:05:09,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865244648] [2020-10-16 12:05:09,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:09,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:09,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504320609] [2020-10-16 12:05:09,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:09,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:09,895 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-10-16 12:05:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:09,939 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-16 12:05:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:09,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 12:05:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:09,944 INFO L225 Difference]: With dead ends: 434 [2020-10-16 12:05:09,945 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 12:05:09,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 12:05:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 12:05:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 12:05:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-16 12:05:09,964 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-16 12:05:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:09,964 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-16 12:05:09,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-16 12:05:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:09,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:09,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:09,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:05:09,967 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1192921599, now seen corresponding path program 1 times [2020-10-16 12:05:09,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:09,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115485237] [2020-10-16 12:05:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:10,051 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-16 12:05:10,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115485237] [2020-10-16 12:05:10,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:10,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:10,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113204068] [2020-10-16 12:05:10,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:10,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:10,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:10,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:10,054 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 4 states. [2020-10-16 12:05:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:10,102 INFO L93 Difference]: Finished difference Result 438 states and 1309 transitions. [2020-10-16 12:05:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:10,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:05:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:10,107 INFO L225 Difference]: With dead ends: 438 [2020-10-16 12:05:10,107 INFO L226 Difference]: Without dead ends: 438 [2020-10-16 12:05:10,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-16 12:05:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2020-10-16 12:05:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-16 12:05:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1309 transitions. [2020-10-16 12:05:10,124 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1309 transitions. Word has length 11 [2020-10-16 12:05:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:10,125 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1309 transitions. [2020-10-16 12:05:10,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1309 transitions. [2020-10-16 12:05:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:10,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:10,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:10,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:05:10,127 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1192920235, now seen corresponding path program 1 times [2020-10-16 12:05:10,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:10,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86331034] [2020-10-16 12:05:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:10,318 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-16 12:05:10,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86331034] [2020-10-16 12:05:10,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:10,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:10,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13345389] [2020-10-16 12:05:10,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:10,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:10,321 INFO L87 Difference]: Start difference. First operand 438 states and 1309 transitions. Second operand 5 states. [2020-10-16 12:05:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:10,417 INFO L93 Difference]: Finished difference Result 426 states and 1265 transitions. [2020-10-16 12:05:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:10,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:05:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:10,422 INFO L225 Difference]: With dead ends: 426 [2020-10-16 12:05:10,423 INFO L226 Difference]: Without dead ends: 426 [2020-10-16 12:05:10,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-16 12:05:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-16 12:05:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 12:05:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1265 transitions. [2020-10-16 12:05:10,438 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1265 transitions. Word has length 11 [2020-10-16 12:05:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:10,439 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1265 transitions. [2020-10-16 12:05:10,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1265 transitions. [2020-10-16 12:05:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:10,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:10,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:10,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:05:10,441 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1194181749, now seen corresponding path program 2 times [2020-10-16 12:05:10,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:10,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72903128] [2020-10-16 12:05:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:10,537 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-16 12:05:10,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72903128] [2020-10-16 12:05:10,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:10,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:10,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916484581] [2020-10-16 12:05:10,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:10,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:10,539 INFO L87 Difference]: Start difference. First operand 426 states and 1265 transitions. Second operand 5 states. [2020-10-16 12:05:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:10,614 INFO L93 Difference]: Finished difference Result 414 states and 1224 transitions. [2020-10-16 12:05:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:10,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:05:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:10,619 INFO L225 Difference]: With dead ends: 414 [2020-10-16 12:05:10,619 INFO L226 Difference]: Without dead ends: 414 [2020-10-16 12:05:10,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-16 12:05:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2020-10-16 12:05:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 12:05:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1213 transitions. [2020-10-16 12:05:10,635 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1213 transitions. Word has length 11 [2020-10-16 12:05:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:10,635 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1213 transitions. [2020-10-16 12:05:10,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1213 transitions. [2020-10-16 12:05:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:10,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:10,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:10,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:05:10,637 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1674135591, now seen corresponding path program 1 times [2020-10-16 12:05:10,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:10,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782658184] [2020-10-16 12:05:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:10,814 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-16 12:05:10,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782658184] [2020-10-16 12:05:10,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:10,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:10,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198164625] [2020-10-16 12:05:10,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:10,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:10,817 INFO L87 Difference]: Start difference. First operand 410 states and 1213 transitions. Second operand 6 states. [2020-10-16 12:05:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:10,955 INFO L93 Difference]: Finished difference Result 478 states and 1432 transitions. [2020-10-16 12:05:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:10,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-16 12:05:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:10,960 INFO L225 Difference]: With dead ends: 478 [2020-10-16 12:05:10,961 INFO L226 Difference]: Without dead ends: 478 [2020-10-16 12:05:10,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-16 12:05:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 438. [2020-10-16 12:05:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-16 12:05:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1306 transitions. [2020-10-16 12:05:10,984 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1306 transitions. Word has length 12 [2020-10-16 12:05:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:10,984 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1306 transitions. [2020-10-16 12:05:10,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1306 transitions. [2020-10-16 12:05:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:10,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:10,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:10,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:05:10,986 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1674176511, now seen corresponding path program 2 times [2020-10-16 12:05:10,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:10,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815333234] [2020-10-16 12:05:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:11,219 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-16 12:05:11,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815333234] [2020-10-16 12:05:11,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:11,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:11,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517339919] [2020-10-16 12:05:11,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:11,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:11,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:11,221 INFO L87 Difference]: Start difference. First operand 438 states and 1306 transitions. Second operand 6 states. [2020-10-16 12:05:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:11,344 INFO L93 Difference]: Finished difference Result 462 states and 1364 transitions. [2020-10-16 12:05:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:11,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-16 12:05:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:11,350 INFO L225 Difference]: With dead ends: 462 [2020-10-16 12:05:11,350 INFO L226 Difference]: Without dead ends: 462 [2020-10-16 12:05:11,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2020-10-16 12:05:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 426. [2020-10-16 12:05:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 12:05:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1253 transitions. [2020-10-16 12:05:11,367 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1253 transitions. Word has length 12 [2020-10-16 12:05:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:11,367 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1253 transitions. [2020-10-16 12:05:11,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1253 transitions. [2020-10-16 12:05:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:11,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:11,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:11,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:05:11,369 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 358553942, now seen corresponding path program 1 times [2020-10-16 12:05:11,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:11,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446446514] [2020-10-16 12:05:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:11,628 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-16 12:05:11,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446446514] [2020-10-16 12:05:11,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:11,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:11,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524391396] [2020-10-16 12:05:11,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:11,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:11,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:11,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:11,631 INFO L87 Difference]: Start difference. First operand 426 states and 1253 transitions. Second operand 7 states. [2020-10-16 12:05:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:11,759 INFO L93 Difference]: Finished difference Result 510 states and 1504 transitions. [2020-10-16 12:05:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:11,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 12:05:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:11,767 INFO L225 Difference]: With dead ends: 510 [2020-10-16 12:05:11,767 INFO L226 Difference]: Without dead ends: 510 [2020-10-16 12:05:11,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-10-16 12:05:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 486. [2020-10-16 12:05:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-16 12:05:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1422 transitions. [2020-10-16 12:05:11,785 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1422 transitions. Word has length 13 [2020-10-16 12:05:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:11,785 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1422 transitions. [2020-10-16 12:05:11,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1422 transitions. [2020-10-16 12:05:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:11,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:11,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:11,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:05:11,787 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 358593932, now seen corresponding path program 2 times [2020-10-16 12:05:11,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:11,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150025122] [2020-10-16 12:05:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:12,192 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-16 12:05:12,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150025122] [2020-10-16 12:05:12,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:12,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:12,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506823000] [2020-10-16 12:05:12,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:12,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:12,195 INFO L87 Difference]: Start difference. First operand 486 states and 1422 transitions. Second operand 7 states. [2020-10-16 12:05:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:12,341 INFO L93 Difference]: Finished difference Result 558 states and 1644 transitions. [2020-10-16 12:05:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:12,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 12:05:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:12,347 INFO L225 Difference]: With dead ends: 558 [2020-10-16 12:05:12,347 INFO L226 Difference]: Without dead ends: 558 [2020-10-16 12:05:12,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-16 12:05:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 510. [2020-10-16 12:05:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-10-16 12:05:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1504 transitions. [2020-10-16 12:05:12,365 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1504 transitions. Word has length 13 [2020-10-16 12:05:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:12,365 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 1504 transitions. [2020-10-16 12:05:12,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1504 transitions. [2020-10-16 12:05:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:12,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:12,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:12,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:05:12,367 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash 359862452, now seen corresponding path program 3 times [2020-10-16 12:05:12,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:12,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254144829] [2020-10-16 12:05:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:12,708 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-16 12:05:12,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254144829] [2020-10-16 12:05:12,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:12,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:12,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102320177] [2020-10-16 12:05:12,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:12,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:12,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:12,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:12,711 INFO L87 Difference]: Start difference. First operand 510 states and 1504 transitions. Second operand 7 states. [2020-10-16 12:05:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:12,930 INFO L93 Difference]: Finished difference Result 566 states and 1614 transitions. [2020-10-16 12:05:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:12,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 12:05:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:12,935 INFO L225 Difference]: With dead ends: 566 [2020-10-16 12:05:12,935 INFO L226 Difference]: Without dead ends: 494 [2020-10-16 12:05:12,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-16 12:05:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 386. [2020-10-16 12:05:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-16 12:05:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1107 transitions. [2020-10-16 12:05:12,950 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1107 transitions. Word has length 13 [2020-10-16 12:05:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:12,951 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 1107 transitions. [2020-10-16 12:05:12,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1107 transitions. [2020-10-16 12:05:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:12,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:12,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:12,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:05:12,953 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 359870388, now seen corresponding path program 1 times [2020-10-16 12:05:12,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:12,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470959234] [2020-10-16 12:05:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:13,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470959234] [2020-10-16 12:05:13,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:13,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644559797] [2020-10-16 12:05:13,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:13,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:13,008 INFO L87 Difference]: Start difference. First operand 386 states and 1107 transitions. Second operand 4 states. [2020-10-16 12:05:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,037 INFO L93 Difference]: Finished difference Result 380 states and 964 transitions. [2020-10-16 12:05:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:13,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:05:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,041 INFO L225 Difference]: With dead ends: 380 [2020-10-16 12:05:13,041 INFO L226 Difference]: Without dead ends: 280 [2020-10-16 12:05:13,041 INFO L677 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-16 12:05:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-16 12:05:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-16 12:05:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-16 12:05:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 689 transitions. [2020-10-16 12:05:13,049 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 689 transitions. Word has length 13 [2020-10-16 12:05:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,050 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 689 transitions. [2020-10-16 12:05:13,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 689 transitions. [2020-10-16 12:05:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:05:13,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:05:13,084 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash -664427399, now seen corresponding path program 1 times [2020-10-16 12:05:13,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300024914] [2020-10-16 12:05:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,144 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-16 12:05:13,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300024914] [2020-10-16 12:05:13,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:13,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728358679] [2020-10-16 12:05:13,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:13,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:13,146 INFO L87 Difference]: Start difference. First operand 280 states and 689 transitions. Second operand 5 states. [2020-10-16 12:05:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,189 INFO L93 Difference]: Finished difference Result 235 states and 532 transitions. [2020-10-16 12:05:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:13,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:05:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,192 INFO L225 Difference]: With dead ends: 235 [2020-10-16 12:05:13,192 INFO L226 Difference]: Without dead ends: 183 [2020-10-16 12:05:13,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-16 12:05:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-16 12:05:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-16 12:05:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 406 transitions. [2020-10-16 12:05:13,198 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 406 transitions. Word has length 14 [2020-10-16 12:05:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,199 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 406 transitions. [2020-10-16 12:05:13,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 406 transitions. [2020-10-16 12:05:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:13,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:05:13,200 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 329564957, now seen corresponding path program 1 times [2020-10-16 12:05:13,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633315561] [2020-10-16 12:05:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,234 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-16 12:05:13,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633315561] [2020-10-16 12:05:13,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:13,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704870612] [2020-10-16 12:05:13,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:13,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:13,237 INFO L87 Difference]: Start difference. First operand 183 states and 406 transitions. Second operand 3 states. [2020-10-16 12:05:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,247 INFO L93 Difference]: Finished difference Result 258 states and 551 transitions. [2020-10-16 12:05:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:13,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 12:05:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,250 INFO L225 Difference]: With dead ends: 258 [2020-10-16 12:05:13,250 INFO L226 Difference]: Without dead ends: 180 [2020-10-16 12:05:13,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-16 12:05:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2020-10-16 12:05:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-16 12:05:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 364 transitions. [2020-10-16 12:05:13,256 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 364 transitions. Word has length 16 [2020-10-16 12:05:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,257 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 364 transitions. [2020-10-16 12:05:13,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 364 transitions. [2020-10-16 12:05:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:05:13,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:05:13,258 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash -85316920, now seen corresponding path program 1 times [2020-10-16 12:05:13,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787931357] [2020-10-16 12:05:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:13,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787931357] [2020-10-16 12:05:13,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:13,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987566208] [2020-10-16 12:05:13,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:13,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:13,340 INFO L87 Difference]: Start difference. First operand 178 states and 364 transitions. Second operand 6 states. [2020-10-16 12:05:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,401 INFO L93 Difference]: Finished difference Result 161 states and 330 transitions. [2020-10-16 12:05:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:13,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:05:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,403 INFO L225 Difference]: With dead ends: 161 [2020-10-16 12:05:13,404 INFO L226 Difference]: Without dead ends: 85 [2020-10-16 12:05:13,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-16 12:05:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-16 12:05:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-16 12:05:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 168 transitions. [2020-10-16 12:05:13,415 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 168 transitions. Word has length 17 [2020-10-16 12:05:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,415 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 168 transitions. [2020-10-16 12:05:13,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 168 transitions. [2020-10-16 12:05:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:05:13,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:05:13,418 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1585187057, now seen corresponding path program 1 times [2020-10-16 12:05:13,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085795997] [2020-10-16 12:05:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:13,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:13,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:13,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:05:13,576 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:05:13,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:05:13,578 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:05:13,597 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L810-->L818: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In502059309 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In502059309 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In502059309 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In502059309 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In502059309 ~y$r_buff0_thd0~0_Out502059309) (or (and .cse0 (= ~y$w_buff0~0_In502059309 ~y~0_Out502059309) .cse1) (and .cse2 (or (and .cse3 (= ~y~0_In502059309 ~y~0_Out502059309)) (and (= ~y$w_buff1~0_In502059309 ~y~0_Out502059309) .cse4 .cse5)))) (= ~y$r_buff1_thd0~0_In502059309 ~y$r_buff1_thd0~0_Out502059309) (or (and .cse4 (= ~y$w_buff1_used~0_Out502059309 0) .cse5) (and (= ~y$w_buff1_used~0_Out502059309 ~y$w_buff1_used~0_In502059309) .cse3)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out502059309| ULTIMATE.start_assume_abort_if_not_~cond_Out502059309) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out502059309 0)) (or (and .cse2 (= ~y$w_buff0_used~0_Out502059309 ~y$w_buff0_used~0_In502059309)) (and (= ~y$w_buff0_used~0_Out502059309 0) .cse0 .cse1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out502059309| (mod ~main$tmp_guard0~0_In502059309 256))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In502059309, ~y$w_buff1~0=~y$w_buff1~0_In502059309, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In502059309, ~y$w_buff0~0=~y$w_buff0~0_In502059309, ~main$tmp_guard0~0=~main$tmp_guard0~0_In502059309, ~y~0=~y~0_In502059309, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In502059309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In502059309} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out502059309, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out502059309|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out502059309|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out502059309|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In502059309, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out502059309|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out502059309|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out502059309|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out502059309|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out502059309, ~y$w_buff1~0=~y$w_buff1~0_In502059309, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out502059309, ~y$w_buff0~0=~y$w_buff0~0_In502059309, ~y~0=~y~0_Out502059309, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out502059309, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out502059309} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:05:13,618 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-16 12:05:13,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,625 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-16 12:05:13,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,626 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-16 12:05:13,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,626 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-16 12:05:13,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,626 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-16 12:05:13,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,631 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-16 12:05:13,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,632 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-16 12:05:13,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,632 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-16 12:05:13,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,633 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-16 12:05:13,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,633 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-16 12:05:13,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,634 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-16 12:05:13,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,635 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-16 12:05:13,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,636 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-16 12:05:13,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,637 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-16 12:05:13,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,637 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-16 12:05:13,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,638 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-16 12:05:13,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,639 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-16 12:05:13,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,639 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-16 12:05:13,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,640 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-16 12:05:13,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,645 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-16 12:05:13,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,645 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-16 12:05:13,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,646 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-16 12:05:13,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,646 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-16 12:05:13,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,646 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-16 12:05:13,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,647 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-16 12:05:13,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,648 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-16 12:05:13,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:13,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:05:13 BasicIcfg [2020-10-16 12:05:13,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:05:13,745 INFO L168 Benchmark]: Toolchain (without parser) took 17912.04 ms. Allocated memory was 147.8 MB in the beginning and 395.3 MB in the end (delta: 247.5 MB). Free memory was 102.0 MB in the beginning and 258.6 MB in the end (delta: -156.6 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,746 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.23 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 159.1 MB in the end (delta: -57.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 205.0 MB. Free memory was 159.1 MB in the beginning and 155.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,748 INFO L168 Benchmark]: Boogie Preprocessor took 61.41 ms. Allocated memory is still 205.0 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,749 INFO L168 Benchmark]: RCFGBuilder took 2169.35 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 153.2 MB in the beginning and 194.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,749 INFO L168 Benchmark]: TraceAbstraction took 14826.03 ms. Allocated memory was 248.5 MB in the beginning and 395.3 MB in the end (delta: 146.8 MB). Free memory was 194.7 MB in the beginning and 258.6 MB in the end (delta: -63.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:13,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.23 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 159.1 MB in the end (delta: -57.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 205.0 MB. Free memory was 159.1 MB in the beginning and 155.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.41 ms. Allocated memory is still 205.0 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2169.35 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 153.2 MB in the beginning and 194.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14826.03 ms. Allocated memory was 248.5 MB in the beginning and 395.3 MB in the end (delta: 146.8 MB). Free memory was 194.7 MB in the beginning and 258.6 MB in the end (delta: -63.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 801 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.8s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 4174 MoverChecksTotal - 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_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1507; [L803] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L804] 0 pthread_t t1508; [L805] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L806] 0 pthread_t t1509; [L807] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0] [L777] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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] [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L745] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L748] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L751] 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) [L751] 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) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 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 [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 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 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L780] 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) [L780] 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) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 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 [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 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 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] 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) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] 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) [L824] 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) [L825] 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)) [L825] 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 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] 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 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] 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)) [L825] 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)) [L826] 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)) [L826] EXPR 0 !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) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !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) [L826] 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)) [L826] 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)) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 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) [L829] 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)) [L829] 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)) [L830] 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)) [L830] 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)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 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_p2_EAX=0, 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=2, 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, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 329 SDtfs, 441 SDslu, 455 SDs, 0 SdLazy, 284 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 262 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 19558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...