/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:34:33,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:34:33,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:34:33,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:34:33,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:34:33,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:34:33,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:34:33,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:34:33,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:34:33,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:34:33,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:34:33,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:34:33,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:34:33,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:34:33,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:34:33,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:34:33,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:34:33,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:34:33,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:34:33,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:34:33,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:34:33,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:34:33,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:34:33,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:34:33,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:34:33,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:34:33,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:34:33,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:34:33,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:34:33,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:34:33,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:34:33,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:34:33,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:34:33,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:34:33,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:34:33,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:34:33,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:34:33,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:34:33,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:34:33,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:34:33,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:34:33,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:34:33,819 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:34:33,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:34:33,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:34:33,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:34:33,824 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:34:33,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:34:33,824 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:34:33,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:34:33,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:34:33,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:34:33,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:34:33,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:34:33,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:34:33,826 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:34:33,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:34:33,826 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:34:33,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:34:33,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:34:33,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:34:33,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:34:33,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:34:33,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:34:33,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:34:33,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:34:33,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:34:33,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:34:33,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:34:33,829 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:34:33,830 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:34:33,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:34:33,830 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:34:34,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:34:34,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:34:34,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:34:34,169 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:34:34,169 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:34:34,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2020-10-22 00:34:34,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7154ef397/56837bc14c3c49ee8870b63b993ef649/FLAG611556512 [2020-10-22 00:34:34,767 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:34:34,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2020-10-22 00:34:34,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7154ef397/56837bc14c3c49ee8870b63b993ef649/FLAG611556512 [2020-10-22 00:34:35,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7154ef397/56837bc14c3c49ee8870b63b993ef649 [2020-10-22 00:34:35,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:34:35,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:34:35,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:34:35,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:34:35,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:34:35,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420b76ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35, skipping insertion in model container [2020-10-22 00:34:35,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:34:35,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:34:35,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:34:35,643 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:34:35,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:34:35,828 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:34:35,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35 WrapperNode [2020-10-22 00:34:35,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:34:35,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:34:35,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:34:35,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:34:35,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:34:35,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:34:35,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:34:35,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:34:35,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... [2020-10-22 00:34:35,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:34:35,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:34:35,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:34:35,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:34:35,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:34:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:34:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:34:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:34:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:34:36,020 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:34:38,007 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:34:38,007 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:34:38,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:34:38 BoogieIcfgContainer [2020-10-22 00:34:38,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:34:38,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:34:38,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:34:38,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:34:38,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:34:35" (1/3) ... [2020-10-22 00:34:38,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a2e27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:34:38, skipping insertion in model container [2020-10-22 00:34:38,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:34:35" (2/3) ... [2020-10-22 00:34:38,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a2e27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:34:38, skipping insertion in model container [2020-10-22 00:34:38,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:34:38" (3/3) ... [2020-10-22 00:34:38,019 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2020-10-22 00:34:38,030 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:34:38,031 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:34:38,038 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:34:38,039 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:34:38,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,068 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,069 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,074 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,078 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,078 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,092 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,092 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:34:38,097 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:34:38,110 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:34:38,131 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:34:38,131 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:34:38,131 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:34:38,131 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:34:38,131 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:34:38,131 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:34:38,132 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:34:38,132 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:34:38,145 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:34:38,146 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 00:34:38,149 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 00:34:38,151 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-22 00:34:38,199 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-22 00:34:38,199 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:34:38,204 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 00:34:38,208 INFO L116 LiptonReduction]: Number of co-enabled transitions 1862 [2020-10-22 00:34:40,371 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-22 00:34:40,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-22 00:34:40,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:40,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 00:34:40,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:34:41,523 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-22 00:34:42,494 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-22 00:34:43,464 WARN L193 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2020-10-22 00:34:43,754 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-22 00:34:44,627 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2020-10-22 00:34:44,893 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-22 00:34:45,572 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 00:34:45,752 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:34:46,665 WARN L193 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-22 00:34:46,969 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-22 00:34:46,999 INFO L131 LiptonReduction]: Checked pairs total: 4886 [2020-10-22 00:34:46,999 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-22 00:34:47,006 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 00:34:47,059 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-22 00:34:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-22 00:34:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 00:34:47,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:47,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 00:34:47,069 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1048843763, now seen corresponding path program 1 times [2020-10-22 00:34:47,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:47,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689839439] [2020-10-22 00:34:47,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:47,352 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-22 00:34:47,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689839439] [2020-10-22 00:34:47,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:47,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:47,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798781202] [2020-10-22 00:34:47,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:47,358 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:47,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 00:34:47,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:47,375 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:47,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:47,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:47,393 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-22 00:34:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:47,486 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-22 00:34:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:47,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 00:34:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:47,511 INFO L225 Difference]: With dead ends: 687 [2020-10-22 00:34:47,511 INFO L226 Difference]: Without dead ends: 562 [2020-10-22 00:34:47,513 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-22 00:34:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-22 00:34:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-22 00:34:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-22 00:34:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-22 00:34:47,613 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-22 00:34:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:47,614 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-22 00:34:47,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-22 00:34:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:34:47,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:47,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:47,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:34:47,617 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1796990296, now seen corresponding path program 1 times [2020-10-22 00:34:47,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:47,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822797362] [2020-10-22 00:34:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:47,819 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-22 00:34:47,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822797362] [2020-10-22 00:34:47,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:47,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:47,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294159959] [2020-10-22 00:34:47,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:47,822 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:47,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:34:47,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:47,827 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:47,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:47,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:47,831 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-22 00:34:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:47,848 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-22 00:34:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:47,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 00:34:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:47,857 INFO L225 Difference]: With dead ends: 537 [2020-10-22 00:34:47,858 INFO L226 Difference]: Without dead ends: 537 [2020-10-22 00:34:47,859 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-22 00:34:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-22 00:34:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-22 00:34:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-22 00:34:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-22 00:34:47,883 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2020-10-22 00:34:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:47,884 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-22 00:34:47,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-22 00:34:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:34:47,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:47,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:47,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:34:47,886 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash 128213800, now seen corresponding path program 1 times [2020-10-22 00:34:47,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:47,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097835506] [2020-10-22 00:34:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:47,987 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-22 00:34:47,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097835506] [2020-10-22 00:34:47,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:47,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:34:47,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1151095513] [2020-10-22 00:34:47,988 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:47,990 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:47,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-10-22 00:34:47,993 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:48,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:48,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:34:48,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:34:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:34:48,042 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 3 states. [2020-10-22 00:34:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:48,078 INFO L93 Difference]: Finished difference Result 536 states and 1631 transitions. [2020-10-22 00:34:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:34:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:48,085 INFO L225 Difference]: With dead ends: 536 [2020-10-22 00:34:48,085 INFO L226 Difference]: Without dead ends: 536 [2020-10-22 00:34:48,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 00:34:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-10-22 00:34:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2020-10-22 00:34:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-22 00:34:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1631 transitions. [2020-10-22 00:34:48,108 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1631 transitions. Word has length 10 [2020-10-22 00:34:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:48,108 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 1631 transitions. [2020-10-22 00:34:48,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:34:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1631 transitions. [2020-10-22 00:34:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:34:48,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:48,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:48,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:34:48,116 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1094303945, now seen corresponding path program 1 times [2020-10-22 00:34:48,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:48,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060478282] [2020-10-22 00:34:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:48,245 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-22 00:34:48,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060478282] [2020-10-22 00:34:48,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:48,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:34:48,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140018354] [2020-10-22 00:34:48,246 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:48,249 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:48,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2020-10-22 00:34:48,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:48,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:48,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:34:48,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:34:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:48,455 INFO L87 Difference]: Start difference. First operand 536 states and 1631 transitions. Second operand 4 states. [2020-10-22 00:34:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:48,529 INFO L93 Difference]: Finished difference Result 532 states and 1616 transitions. [2020-10-22 00:34:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:48,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:34:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:48,535 INFO L225 Difference]: With dead ends: 532 [2020-10-22 00:34:48,535 INFO L226 Difference]: Without dead ends: 532 [2020-10-22 00:34:48,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-22 00:34:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-10-22 00:34:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2020-10-22 00:34:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-10-22 00:34:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1616 transitions. [2020-10-22 00:34:48,557 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1616 transitions. Word has length 11 [2020-10-22 00:34:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:48,557 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 1616 transitions. [2020-10-22 00:34:48,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:34:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1616 transitions. [2020-10-22 00:34:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:34:48,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:48,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:48,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:34:48,562 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1885506343, now seen corresponding path program 1 times [2020-10-22 00:34:48,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:48,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464984354] [2020-10-22 00:34:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:48,626 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-22 00:34:48,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464984354] [2020-10-22 00:34:48,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:48,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:34:48,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620936555] [2020-10-22 00:34:48,627 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:48,629 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:48,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 35 transitions. [2020-10-22 00:34:48,633 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:48,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:48,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:34:48,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:34:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:48,823 INFO L87 Difference]: Start difference. First operand 532 states and 1616 transitions. Second operand 4 states. [2020-10-22 00:34:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:48,882 INFO L93 Difference]: Finished difference Result 513 states and 1549 transitions. [2020-10-22 00:34:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:34:48,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:34:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:48,887 INFO L225 Difference]: With dead ends: 513 [2020-10-22 00:34:48,887 INFO L226 Difference]: Without dead ends: 513 [2020-10-22 00:34:48,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-22 00:34:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-22 00:34:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-22 00:34:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-22 00:34:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1549 transitions. [2020-10-22 00:34:48,903 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1549 transitions. Word has length 11 [2020-10-22 00:34:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:48,904 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1549 transitions. [2020-10-22 00:34:48,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:34:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1549 transitions. [2020-10-22 00:34:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:34:48,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:48,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:48,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:34:48,905 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1652805384, now seen corresponding path program 1 times [2020-10-22 00:34:48,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:48,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224965997] [2020-10-22 00:34:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:48,955 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-22 00:34:48,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224965997] [2020-10-22 00:34:48,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:48,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:34:48,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424515639] [2020-10-22 00:34:48,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:48,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:48,965 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 65 transitions. [2020-10-22 00:34:48,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:49,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:49,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:34:49,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:34:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:49,364 INFO L87 Difference]: Start difference. First operand 513 states and 1549 transitions. Second operand 4 states. [2020-10-22 00:34:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:49,408 INFO L93 Difference]: Finished difference Result 674 states and 2001 transitions. [2020-10-22 00:34:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:49,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 00:34:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:49,412 INFO L225 Difference]: With dead ends: 674 [2020-10-22 00:34:49,412 INFO L226 Difference]: Without dead ends: 374 [2020-10-22 00:34:49,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-22 00:34:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-10-22 00:34:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2020-10-22 00:34:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-22 00:34:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2020-10-22 00:34:49,436 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2020-10-22 00:34:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:49,437 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2020-10-22 00:34:49,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:34:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2020-10-22 00:34:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:34:49,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:49,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:49,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:34:49,438 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1639666906, now seen corresponding path program 1 times [2020-10-22 00:34:49,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:49,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373086779] [2020-10-22 00:34:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:49,645 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-22 00:34:49,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373086779] [2020-10-22 00:34:49,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:49,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:49,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360242443] [2020-10-22 00:34:49,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:49,649 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:49,655 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 76 transitions. [2020-10-22 00:34:49,655 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:50,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11374#(or (and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-22 00:34:50,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:34:50,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:34:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:34:50,514 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 6 states. [2020-10-22 00:34:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:50,683 INFO L93 Difference]: Finished difference Result 419 states and 1203 transitions. [2020-10-22 00:34:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:34:50,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 00:34:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:50,687 INFO L225 Difference]: With dead ends: 419 [2020-10-22 00:34:50,687 INFO L226 Difference]: Without dead ends: 419 [2020-10-22 00:34:50,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:34:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2020-10-22 00:34:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 371. [2020-10-22 00:34:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-10-22 00:34:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1054 transitions. [2020-10-22 00:34:50,699 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1054 transitions. Word has length 13 [2020-10-22 00:34:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:50,700 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 1054 transitions. [2020-10-22 00:34:50,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:34:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1054 transitions. [2020-10-22 00:34:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:34:50,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:50,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:50,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:34:50,701 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1925064169, now seen corresponding path program 1 times [2020-10-22 00:34:50,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:50,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042628608] [2020-10-22 00:34:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:50,782 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-22 00:34:50,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042628608] [2020-10-22 00:34:50,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:50,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:50,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [997703816] [2020-10-22 00:34:50,784 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:50,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:50,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 101 transitions. [2020-10-22 00:34:50,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:51,083 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-22 00:34:51,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:51,487 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:51,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:34:51,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:34:51,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:34:51,489 INFO L87 Difference]: Start difference. First operand 371 states and 1054 transitions. Second operand 4 states. [2020-10-22 00:34:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:51,516 INFO L93 Difference]: Finished difference Result 357 states and 902 transitions. [2020-10-22 00:34:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:34:51,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 00:34:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:51,519 INFO L225 Difference]: With dead ends: 357 [2020-10-22 00:34:51,519 INFO L226 Difference]: Without dead ends: 272 [2020-10-22 00:34:51,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-22 00:34:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2020-10-22 00:34:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-10-22 00:34:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 674 transitions. [2020-10-22 00:34:51,528 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 674 transitions. Word has length 14 [2020-10-22 00:34:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:51,529 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 674 transitions. [2020-10-22 00:34:51,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:34:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 674 transitions. [2020-10-22 00:34:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:34:51,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:51,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:51,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:34:51,530 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1136296573, now seen corresponding path program 1 times [2020-10-22 00:34:51,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:51,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480596817] [2020-10-22 00:34:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:51,602 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-22 00:34:51,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480596817] [2020-10-22 00:34:51,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:51,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:34:51,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160557119] [2020-10-22 00:34:51,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:51,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:51,615 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 97 transitions. [2020-10-22 00:34:51,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:52,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13452#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:34:52,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:34:52,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:34:52,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:34:52,217 INFO L87 Difference]: Start difference. First operand 272 states and 674 transitions. Second operand 6 states. [2020-10-22 00:34:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:52,279 INFO L93 Difference]: Finished difference Result 224 states and 509 transitions. [2020-10-22 00:34:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:34:52,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 00:34:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:52,284 INFO L225 Difference]: With dead ends: 224 [2020-10-22 00:34:52,285 INFO L226 Difference]: Without dead ends: 179 [2020-10-22 00:34:52,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:34:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-22 00:34:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-10-22 00:34:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-22 00:34:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 399 transitions. [2020-10-22 00:34:52,291 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 399 transitions. Word has length 15 [2020-10-22 00:34:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:52,292 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 399 transitions. [2020-10-22 00:34:52,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:34:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 399 transitions. [2020-10-22 00:34:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:34:52,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:52,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:52,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:34:52,293 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1437572847, now seen corresponding path program 1 times [2020-10-22 00:34:52,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:52,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995822447] [2020-10-22 00:34:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:52,398 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-22 00:34:52,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995822447] [2020-10-22 00:34:52,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:52,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:34:52,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1144706499] [2020-10-22 00:34:52,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:52,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:52,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 43 transitions. [2020-10-22 00:34:52,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:52,695 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:34:52,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:34:52,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:34:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:34:52,697 INFO L87 Difference]: Start difference. First operand 179 states and 399 transitions. Second operand 5 states. [2020-10-22 00:34:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:52,765 INFO L93 Difference]: Finished difference Result 233 states and 504 transitions. [2020-10-22 00:34:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:34:52,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-22 00:34:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:52,768 INFO L225 Difference]: With dead ends: 233 [2020-10-22 00:34:52,768 INFO L226 Difference]: Without dead ends: 181 [2020-10-22 00:34:52,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:34:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-22 00:34:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2020-10-22 00:34:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-22 00:34:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 383 transitions. [2020-10-22 00:34:52,774 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 383 transitions. Word has length 17 [2020-10-22 00:34:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:52,775 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 383 transitions. [2020-10-22 00:34:52,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:34:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 383 transitions. [2020-10-22 00:34:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:34:52,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:52,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:52,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:34:52,776 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1219635356, now seen corresponding path program 1 times [2020-10-22 00:34:52,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:52,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100235653] [2020-10-22 00:34:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:53,353 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-22 00:34:53,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100235653] [2020-10-22 00:34:53,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:53,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:34:53,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1914808734] [2020-10-22 00:34:53,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:53,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:53,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 130 transitions. [2020-10-22 00:34:53,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:54,258 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 108 [2020-10-22 00:34:54,268 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 4, 2, 3, 2, 1] term [2020-10-22 00:34:54,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,269 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-22 00:34:54,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:54,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,288 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:54,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,291 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:54,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:54,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,324 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:54,326 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:54,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:54,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,362 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:54,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:54,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,391 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:54,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 00:34:54,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:54,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:54,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,650 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:54,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:54,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:54,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,690 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:54,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:54,698 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:54,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:54,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:54,778 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 00:34:54,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:54,913 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-22 00:34:54,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:54,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,973 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:54,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:54,985 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:54,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:54,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:54,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:54,997 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:55,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:55,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:34:55,031 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:34:55,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:55,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,051 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:55,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 00:34:55,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:55,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:34:55,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,583 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:55,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,614 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:34:55,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:55,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,762 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:55,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:55,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:55,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:56,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:56,002 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:56,023 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:56,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 00:34:56,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:56,211 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-10-22 00:34:56,636 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 35 [2020-10-22 00:34:56,924 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 35 [2020-10-22 00:34:57,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:57,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:57,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:34:57,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:57,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:57,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:34:57,192 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:57,200 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:57,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,218 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:57,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:34:57,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,268 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:57,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:34:57,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:34:57,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:34:57,286 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:34:57,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 00:34:57,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:34:57,490 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2020-10-22 00:34:57,666 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-10-22 00:34:57,803 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-10-22 00:34:58,016 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14643#(and (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0)) (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256))) (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0)) (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))))), 14644#(or (not (= (mod ~x$w_buff0_used~0 256) 0)) (and (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x$w_buff0~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256)))))] [2020-10-22 00:34:58,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 00:34:58,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 00:34:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:34:58,017 INFO L87 Difference]: Start difference. First operand 178 states and 383 transitions. Second operand 10 states. [2020-10-22 00:34:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:58,273 INFO L93 Difference]: Finished difference Result 239 states and 492 transitions. [2020-10-22 00:34:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:34:58,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-22 00:34:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:58,276 INFO L225 Difference]: With dead ends: 239 [2020-10-22 00:34:58,276 INFO L226 Difference]: Without dead ends: 173 [2020-10-22 00:34:58,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:34:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-22 00:34:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2020-10-22 00:34:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-22 00:34:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 345 transitions. [2020-10-22 00:34:58,282 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 345 transitions. Word has length 18 [2020-10-22 00:34:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:58,284 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 345 transitions. [2020-10-22 00:34:58,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 00:34:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 345 transitions. [2020-10-22 00:34:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:34:58,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:58,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:58,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:34:58,286 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1952554098, now seen corresponding path program 1 times [2020-10-22 00:34:58,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:58,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703171247] [2020-10-22 00:34:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:34:58,389 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-22 00:34:58,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703171247] [2020-10-22 00:34:58,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:34:58,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:34:58,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749809228] [2020-10-22 00:34:58,390 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:34:58,393 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:34:58,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 108 transitions. [2020-10-22 00:34:58,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:34:58,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15232#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:34:58,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:34:58,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:34:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:34:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:34:58,821 INFO L87 Difference]: Start difference. First operand 170 states and 345 transitions. Second operand 7 states. [2020-10-22 00:34:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:34:58,888 INFO L93 Difference]: Finished difference Result 153 states and 311 transitions. [2020-10-22 00:34:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:34:58,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 00:34:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:34:58,890 INFO L225 Difference]: With dead ends: 153 [2020-10-22 00:34:58,890 INFO L226 Difference]: Without dead ends: 50 [2020-10-22 00:34:58,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:34:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-22 00:34:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-22 00:34:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-22 00:34:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-22 00:34:58,893 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 18 [2020-10-22 00:34:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:34:58,894 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-22 00:34:58,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:34:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-22 00:34:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:34:58,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:34:58,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:34:58,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:34:58,895 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:34:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:34:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash -954695949, now seen corresponding path program 1 times [2020-10-22 00:34:58,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:34:58,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627158464] [2020-10-22 00:34:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:34:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:34:58,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:34:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:34:59,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:34:59,062 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:34:59,063 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:34:59,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:34:59,064 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:34:59,077 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In1397349389 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In1397349389 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In1397349389 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In1397349389 256) 0))) (let ((.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse0 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (or (and (= ~x$w_buff1_used~0_In1397349389 ~x$w_buff1_used~0_Out1397349389) .cse0) (and .cse1 (= ~x$w_buff1_used~0_Out1397349389 0) .cse2)) (= ~x$r_buff0_thd0~0_Out1397349389 ~x$r_buff0_thd0~0_In1397349389) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1397349389 0)) (or (and .cse3 (= ~x$w_buff0_used~0_Out1397349389 0) .cse4) (and .cse5 (= ~x$w_buff0_used~0_In1397349389 ~x$w_buff0_used~0_Out1397349389))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1397349389 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1397349389|) (= ~x$r_buff1_thd0~0_Out1397349389 ~x$r_buff1_thd0~0_In1397349389) (= (mod ~main$tmp_guard0~0_In1397349389 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1397349389|) (or (and .cse3 .cse4 (= ~x$w_buff0~0_In1397349389 ~x~0_Out1397349389)) (and .cse5 (or (and (= ~x~0_In1397349389 ~x~0_Out1397349389) .cse0) (and .cse1 (= ~x$w_buff1~0_In1397349389 ~x~0_Out1397349389) .cse2))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1397349389, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1397349389, ~x$w_buff1~0=~x$w_buff1~0_In1397349389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1397349389, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1397349389, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1397349389, ~x~0=~x~0_In1397349389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1397349389} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1397349389, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1397349389, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1397349389|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1397349389|, ~x$w_buff1~0=~x$w_buff1~0_In1397349389, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1397349389, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1397349389|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1397349389|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1397349389, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1397349389|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1397349389, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1397349389, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out1397349389|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1397349389|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1397349389, ~x~0=~x~0_Out1397349389} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-22 00:34:59,086 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-22 00:34:59,086 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-10-22 00:34:59,090 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-22 00:34:59,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,091 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-22 00:34:59,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,091 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-22 00:34:59,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,092 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-22 00:34:59,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,093 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-22 00:34:59,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,093 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-22 00:34:59,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,094 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-22 00:34:59,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,094 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-22 00:34:59,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,094 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-22 00:34:59,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,095 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-22 00:34:59,095 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,095 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-22 00:34:59,095 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,095 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-22 00:34:59,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,096 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-22 00:34:59,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,096 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-22 00:34:59,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,097 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-22 00:34:59,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,097 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-22 00:34:59,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,097 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-22 00:34:59,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,099 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-22 00:34:59,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,103 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-22 00:34:59,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,104 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-22 00:34:59,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,104 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-22 00:34:59,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,104 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-22 00:34:59,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,105 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-22 00:34:59,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,105 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-22 00:34:59,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,105 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-22 00:34:59,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,105 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-22 00:34:59,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,106 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-22 00:34:59,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,106 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-22 00:34:59,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,106 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-22 00:34:59,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,107 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-22 00:34:59,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:34:59,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:34:59 BasicIcfg [2020-10-22 00:34:59,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:34:59,203 INFO L168 Benchmark]: Toolchain (without parser) took 24187.64 ms. Allocated memory was 140.0 MB in the beginning and 451.4 MB in the end (delta: 311.4 MB). Free memory was 101.1 MB in the beginning and 221.9 MB in the end (delta: -120.9 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,203 INFO L168 Benchmark]: CDTParser took 2.39 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.40 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.0 MB in the beginning and 152.7 MB in the end (delta: -52.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,210 INFO L168 Benchmark]: Boogie Preprocessor took 48.35 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 147.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,211 INFO L168 Benchmark]: RCFGBuilder took 2064.54 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 147.4 MB in the beginning and 155.7 MB in the end (delta: -8.3 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,213 INFO L168 Benchmark]: TraceAbstraction took 21189.60 ms. Allocated memory was 246.9 MB in the beginning and 451.4 MB in the end (delta: 204.5 MB). Free memory was 155.7 MB in the beginning and 221.9 MB in the end (delta: -66.2 MB). Peak memory consumption was 138.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:34:59,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.39 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.40 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.0 MB in the beginning and 152.7 MB in the end (delta: -52.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.35 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 147.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2064.54 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 147.4 MB in the beginning and 155.7 MB in the end (delta: -8.3 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21189.60 ms. Allocated memory was 246.9 MB in the beginning and 451.4 MB in the end (delta: 204.5 MB). Free memory was 155.7 MB in the beginning and 221.9 MB in the end (delta: -66.2 MB). Peak memory consumption was 138.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1012 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4886 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 232 SDtfs, 314 SDslu, 412 SDs, 0 SdLazy, 247 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 213 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 18703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...