/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:55:40,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:55:40,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:55:40,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:55:40,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:55:40,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:55:40,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:55:40,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:55:40,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:55:40,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:55:40,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:55:40,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:55:40,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:55:40,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:55:40,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:55:40,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:55:40,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:55:40,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:55:40,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:55:40,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:55:40,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:55:40,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:55:40,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:55:40,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:55:40,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:55:40,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:55:40,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:55:40,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:55:40,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:55:40,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:55:40,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:55:40,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:55:40,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:55:40,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:55:40,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:55:40,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:55:40,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:55:40,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:55:40,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:55:40,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:55:40,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:55:40,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 14:55:40,939 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:55:40,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:55:40,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:55:40,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:55:40,940 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:55:40,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:55:40,941 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:55:40,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:55:40,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:55:40,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:55:40,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:55:40,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:55:40,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:55:40,942 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:55:40,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:55:40,943 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:55:40,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:55:40,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:55:40,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:55:40,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:55:40,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:55:40,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:55:40,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:55:40,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:55:40,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:55:40,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:55:40,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:55:40,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:55:40,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:55:40,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:55:41,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:55:41,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:55:41,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:55:41,254 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:55:41,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:55:41,255 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-11 14:55:41,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50aaf53e/723a97636d9d4db2938d25f98f41d1f1/FLAG8c10fc07b [2020-10-11 14:55:41,889 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:55:41,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-11 14:55:41,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50aaf53e/723a97636d9d4db2938d25f98f41d1f1/FLAG8c10fc07b [2020-10-11 14:55:42,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50aaf53e/723a97636d9d4db2938d25f98f41d1f1 [2020-10-11 14:55:42,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:55:42,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:55:42,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:55:42,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:55:42,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:55:42,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:42,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76927b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42, skipping insertion in model container [2020-10-11 14:55:42,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:42,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:55:42,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:55:42,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:55:42,733 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:55:42,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:55:42,918 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:55:42,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42 WrapperNode [2020-10-11 14:55:42,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:55:42,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:55:42,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:55:42,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:55:42,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:42,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:42,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:55:42,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:55:42,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:55:42,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:55:42,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:42,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:43,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:43,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:43,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:43,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:43,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (1/1) ... [2020-10-11 14:55:43,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:55:43,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:55:43,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:55:43,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:55:43,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (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-11 14:55:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:55:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:55:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:55:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:55:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:55:43,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:55:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:55:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:55:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 14:55:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 14:55:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 14:55:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 14:55:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:55:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:55:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:55:43,113 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:55:45,124 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:55:45,125 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:55:45,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:45 BoogieIcfgContainer [2020-10-11 14:55:45,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:55:45,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:55:45,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:55:45,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:55:45,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:55:42" (1/3) ... [2020-10-11 14:55:45,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f0752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:45, skipping insertion in model container [2020-10-11 14:55:45,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:42" (2/3) ... [2020-10-11 14:55:45,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f0752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:45, skipping insertion in model container [2020-10-11 14:55:45,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:45" (3/3) ... [2020-10-11 14:55:45,137 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2020-10-11 14:55:45,149 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:55:45,149 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:55:45,157 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:55:45,158 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:55:45,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,191 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,192 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,193 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,193 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,204 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,204 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,204 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,205 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,213 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,216 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,217 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,218 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,221 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,223 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,223 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:45,239 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 14:55:45,262 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:55:45,262 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:55:45,262 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:55:45,262 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:55:45,262 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:55:45,263 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:55:45,263 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:55:45,263 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:55:45,278 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:55:45,281 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-11 14:55:45,284 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-11 14:55:45,286 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-11 14:55:45,338 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-11 14:55:45,338 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:55:45,344 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-11 14:55:45,349 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-11 14:55:45,661 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-11 14:55:45,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:45,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:45,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:45,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:45,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:45,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:45,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:45,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:45,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:45,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:45,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:45,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:45,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:45,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:55:45,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-11 14:55:45,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:46,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:46,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:46,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:46,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:46,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:46,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:46,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:46,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:46,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:46,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-11 14:55:46,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-11 14:55:46,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-11 14:55:46,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:46,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:46,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 14:55:46,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:46,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:46,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:46,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:46,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:46,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:46,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:46,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:46,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:47,478 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-11 14:55:47,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-11 14:55:47,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:47,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:47,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,354 WARN L193 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-11 14:55:48,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:48,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:48,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:48,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:55:48,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:48,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 14:55:48,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:48,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:48,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:48,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:48,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:48,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-11 14:55:48,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:55:48,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:55:48,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:48,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:48,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:55:48,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-11 14:55:48,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:49,389 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-11 14:55:49,522 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 14:55:49,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:55:49,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-11 14:55:50,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:50,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:55:50,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:50,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-11 14:55:50,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:50,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-11 14:55:50,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:50,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-11 14:55:50,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:51,388 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-11 14:55:51,516 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-11 14:55:51,527 INFO L132 LiptonReduction]: Checked pairs total: 6555 [2020-10-11 14:55:51,527 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-11 14:55:51,534 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-11 14:55:51,718 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-10-11 14:55:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-10-11 14:55:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 14:55:51,730 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:51,731 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:51,731 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2065333905, now seen corresponding path program 1 times [2020-10-11 14:55:51,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:51,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596032799] [2020-10-11 14:55:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:52,032 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-11 14:55:52,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596032799] [2020-10-11 14:55:52,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:52,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:55:52,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770254818] [2020-10-11 14:55:52,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:55:52,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:55:52,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:52,062 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-10-11 14:55:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:52,218 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-11 14:55:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:55:52,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-11 14:55:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:52,264 INFO L225 Difference]: With dead ends: 2602 [2020-10-11 14:55:52,264 INFO L226 Difference]: Without dead ends: 2202 [2020-10-11 14:55:52,266 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-10-11 14:55:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-10-11 14:55:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-11 14:55:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-10-11 14:55:52,454 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-10-11 14:55:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:52,455 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-10-11 14:55:52,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:55:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-10-11 14:55:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:55:52,459 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:52,460 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:52,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:55:52,460 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1342131682, now seen corresponding path program 1 times [2020-10-11 14:55:52,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:52,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437331878] [2020-10-11 14:55:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:52,678 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-11 14:55:52,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437331878] [2020-10-11 14:55:52,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:52,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:55:52,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527275099] [2020-10-11 14:55:52,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:55:52,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:55:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:55:52,681 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-10-11 14:55:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:52,764 INFO L93 Difference]: Finished difference Result 2502 states and 9254 transitions. [2020-10-11 14:55:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:55:52,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-11 14:55:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:52,784 INFO L225 Difference]: With dead ends: 2502 [2020-10-11 14:55:52,784 INFO L226 Difference]: Without dead ends: 2102 [2020-10-11 14:55:52,785 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-10-11 14:55:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102. [2020-10-11 14:55:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-10-11 14:55:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions. [2020-10-11 14:55:52,868 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12 [2020-10-11 14:55:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:52,869 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions. [2020-10-11 14:55:52,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:55:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions. [2020-10-11 14:55:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:55:52,872 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:52,873 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:52,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:55:52,873 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1343575012, now seen corresponding path program 1 times [2020-10-11 14:55:52,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:52,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318524423] [2020-10-11 14:55:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:53,033 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-11 14:55:53,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318524423] [2020-10-11 14:55:53,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:53,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:55:53,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177901514] [2020-10-11 14:55:53,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:55:53,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:53,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:55:53,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:55:53,036 INFO L87 Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 4 states. [2020-10-11 14:55:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:53,130 INFO L93 Difference]: Finished difference Result 2396 states and 8804 transitions. [2020-10-11 14:55:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:55:53,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-11 14:55:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:53,149 INFO L225 Difference]: With dead ends: 2396 [2020-10-11 14:55:53,149 INFO L226 Difference]: Without dead ends: 2046 [2020-10-11 14:55:53,150 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-10-11 14:55:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2020-10-11 14:55:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2020-10-11 14:55:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 7716 transitions. [2020-10-11 14:55:53,236 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 7716 transitions. Word has length 13 [2020-10-11 14:55:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:53,237 INFO L481 AbstractCegarLoop]: Abstraction has 2046 states and 7716 transitions. [2020-10-11 14:55:53,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:55:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 7716 transitions. [2020-10-11 14:55:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:55:53,240 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:53,241 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:53,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:55:53,241 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash -701214973, now seen corresponding path program 1 times [2020-10-11 14:55:53,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:53,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023954933] [2020-10-11 14:55:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:53,420 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-11 14:55:53,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023954933] [2020-10-11 14:55:53,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:53,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:55:53,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847955506] [2020-10-11 14:55:53,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:55:53,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:55:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:53,425 INFO L87 Difference]: Start difference. First operand 2046 states and 7716 transitions. Second operand 5 states. [2020-10-11 14:55:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:53,563 INFO L93 Difference]: Finished difference Result 2214 states and 8110 transitions. [2020-10-11 14:55:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:55:53,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-11 14:55:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:53,582 INFO L225 Difference]: With dead ends: 2214 [2020-10-11 14:55:53,582 INFO L226 Difference]: Without dead ends: 1934 [2020-10-11 14:55:53,583 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-10-11 14:55:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2020-10-11 14:55:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-10-11 14:55:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 7220 transitions. [2020-10-11 14:55:53,653 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 7220 transitions. Word has length 14 [2020-10-11 14:55:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:53,653 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 7220 transitions. [2020-10-11 14:55:53,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:55:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 7220 transitions. [2020-10-11 14:55:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:55:53,657 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:53,657 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:53,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:55:53,657 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1610053253, now seen corresponding path program 1 times [2020-10-11 14:55:53,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:53,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744518090] [2020-10-11 14:55:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:53,789 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-11 14:55:53,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744518090] [2020-10-11 14:55:53,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:53,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:55:53,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337029893] [2020-10-11 14:55:53,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:55:53,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:55:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:53,791 INFO L87 Difference]: Start difference. First operand 1934 states and 7220 transitions. Second operand 5 states. [2020-10-11 14:55:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:53,907 INFO L93 Difference]: Finished difference Result 2160 states and 7898 transitions. [2020-10-11 14:55:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:55:53,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-11 14:55:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:53,925 INFO L225 Difference]: With dead ends: 2160 [2020-10-11 14:55:53,926 INFO L226 Difference]: Without dead ends: 1950 [2020-10-11 14:55:53,926 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2020-10-11 14:55:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1950. [2020-10-11 14:55:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2020-10-11 14:55:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 7276 transitions. [2020-10-11 14:55:54,010 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 7276 transitions. Word has length 15 [2020-10-11 14:55:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:54,010 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 7276 transitions. [2020-10-11 14:55:54,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:55:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 7276 transitions. [2020-10-11 14:55:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:55:54,014 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:54,014 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:54,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:55:54,014 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1351736453, now seen corresponding path program 2 times [2020-10-11 14:55:54,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:54,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570516474] [2020-10-11 14:55:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:54,153 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-11 14:55:54,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570516474] [2020-10-11 14:55:54,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:54,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:55:54,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622920718] [2020-10-11 14:55:54,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:55:54,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:54,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:55:54,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:55:54,156 INFO L87 Difference]: Start difference. First operand 1950 states and 7276 transitions. Second operand 6 states. [2020-10-11 14:55:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:54,299 INFO L93 Difference]: Finished difference Result 2076 states and 7582 transitions. [2020-10-11 14:55:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:55:54,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-11 14:55:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:54,317 INFO L225 Difference]: With dead ends: 2076 [2020-10-11 14:55:54,317 INFO L226 Difference]: Without dead ends: 1866 [2020-10-11 14:55:54,317 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:55:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2020-10-11 14:55:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1850. [2020-10-11 14:55:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2020-10-11 14:55:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 6876 transitions. [2020-10-11 14:55:54,379 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 6876 transitions. Word has length 15 [2020-10-11 14:55:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:54,380 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 6876 transitions. [2020-10-11 14:55:54,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:55:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 6876 transitions. [2020-10-11 14:55:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:55:54,384 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:54,384 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:54,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:55:54,384 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash 666758434, now seen corresponding path program 1 times [2020-10-11 14:55:54,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:54,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103438291] [2020-10-11 14:55:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:54,517 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-11 14:55:54,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103438291] [2020-10-11 14:55:54,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:54,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:55:54,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727983013] [2020-10-11 14:55:54,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:55:54,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:55:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:55:54,520 INFO L87 Difference]: Start difference. First operand 1850 states and 6876 transitions. Second operand 4 states. [2020-10-11 14:55:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:54,564 INFO L93 Difference]: Finished difference Result 1850 states and 6260 transitions. [2020-10-11 14:55:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:55:54,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-11 14:55:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:54,576 INFO L225 Difference]: With dead ends: 1850 [2020-10-11 14:55:54,576 INFO L226 Difference]: Without dead ends: 1450 [2020-10-11 14:55:54,577 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-11 14:55:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-11 14:55:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-11 14:55:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 4876 transitions. [2020-10-11 14:55:54,621 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 4876 transitions. Word has length 16 [2020-10-11 14:55:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:54,621 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 4876 transitions. [2020-10-11 14:55:54,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:55:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 4876 transitions. [2020-10-11 14:55:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 14:55:54,624 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:54,625 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:54,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:55:54,625 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1803367302, now seen corresponding path program 1 times [2020-10-11 14:55:54,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:54,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879857959] [2020-10-11 14:55:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:54,701 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-11 14:55:54,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879857959] [2020-10-11 14:55:54,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:54,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:55:54,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279759472] [2020-10-11 14:55:54,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:55:54,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:55:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:54,704 INFO L87 Difference]: Start difference. First operand 1450 states and 4876 transitions. Second operand 5 states. [2020-10-11 14:55:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:54,755 INFO L93 Difference]: Finished difference Result 1176 states and 3588 transitions. [2020-10-11 14:55:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:55:54,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 14:55:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:54,762 INFO L225 Difference]: With dead ends: 1176 [2020-10-11 14:55:54,762 INFO L226 Difference]: Without dead ends: 920 [2020-10-11 14:55:54,763 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:55:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-10-11 14:55:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2020-10-11 14:55:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-10-11 14:55:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2756 transitions. [2020-10-11 14:55:54,786 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2756 transitions. Word has length 17 [2020-10-11 14:55:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:54,787 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 2756 transitions. [2020-10-11 14:55:54,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:55:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2756 transitions. [2020-10-11 14:55:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 14:55:54,789 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:54,789 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:54,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:55:54,790 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash 690303399, now seen corresponding path program 1 times [2020-10-11 14:55:54,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:54,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397265505] [2020-10-11 14:55:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:55:54,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397265505] [2020-10-11 14:55:54,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:54,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:55:54,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25057832] [2020-10-11 14:55:54,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:55:54,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:55:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:55:54,847 INFO L87 Difference]: Start difference. First operand 920 states and 2756 transitions. Second operand 4 states. [2020-10-11 14:55:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:54,878 INFO L93 Difference]: Finished difference Result 1350 states and 3879 transitions. [2020-10-11 14:55:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:55:54,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-11 14:55:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:54,882 INFO L225 Difference]: With dead ends: 1350 [2020-10-11 14:55:54,882 INFO L226 Difference]: Without dead ends: 942 [2020-10-11 14:55:54,883 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 14:55:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2020-10-11 14:55:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 902. [2020-10-11 14:55:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2020-10-11 14:55:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2571 transitions. [2020-10-11 14:55:54,905 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 2571 transitions. Word has length 19 [2020-10-11 14:55:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:54,906 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 2571 transitions. [2020-10-11 14:55:54,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:55:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 2571 transitions. [2020-10-11 14:55:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 14:55:54,908 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:54,908 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:54,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:55:54,909 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash -217914650, now seen corresponding path program 1 times [2020-10-11 14:55:54,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:54,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177474656] [2020-10-11 14:55:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:54,997 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-11 14:55:54,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177474656] [2020-10-11 14:55:54,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:54,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:55:54,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001856766] [2020-10-11 14:55:54,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:55:54,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:54,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:55:54,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:55:54,999 INFO L87 Difference]: Start difference. First operand 902 states and 2571 transitions. Second operand 6 states. [2020-10-11 14:55:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:55,064 INFO L93 Difference]: Finished difference Result 746 states and 2081 transitions. [2020-10-11 14:55:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:55:55,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-11 14:55:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:55,068 INFO L225 Difference]: With dead ends: 746 [2020-10-11 14:55:55,068 INFO L226 Difference]: Without dead ends: 658 [2020-10-11 14:55:55,069 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-10-11 14:55:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2020-10-11 14:55:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2020-10-11 14:55:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1859 transitions. [2020-10-11 14:55:55,085 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1859 transitions. Word has length 19 [2020-10-11 14:55:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:55,086 INFO L481 AbstractCegarLoop]: Abstraction has 658 states and 1859 transitions. [2020-10-11 14:55:55,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:55:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1859 transitions. [2020-10-11 14:55:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 14:55:55,088 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:55,088 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:55,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:55:55,089 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1808389085, now seen corresponding path program 1 times [2020-10-11 14:55:55,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:55,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489468879] [2020-10-11 14:55:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:55,185 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-11 14:55:55,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489468879] [2020-10-11 14:55:55,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:55,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:55:55,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020496232] [2020-10-11 14:55:55,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:55:55,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:55:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:55,187 INFO L87 Difference]: Start difference. First operand 658 states and 1859 transitions. Second operand 7 states. [2020-10-11 14:55:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:55,286 INFO L93 Difference]: Finished difference Result 943 states and 2591 transitions. [2020-10-11 14:55:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:55:55,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-11 14:55:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:55,290 INFO L225 Difference]: With dead ends: 943 [2020-10-11 14:55:55,290 INFO L226 Difference]: Without dead ends: 662 [2020-10-11 14:55:55,290 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:55:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-11 14:55:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 654. [2020-10-11 14:55:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2020-10-11 14:55:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1764 transitions. [2020-10-11 14:55:55,309 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1764 transitions. Word has length 22 [2020-10-11 14:55:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:55,310 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 1764 transitions. [2020-10-11 14:55:55,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:55:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1764 transitions. [2020-10-11 14:55:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 14:55:55,312 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:55,312 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:55,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:55:55,312 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2147199299, now seen corresponding path program 2 times [2020-10-11 14:55:55,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:55,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909957963] [2020-10-11 14:55:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:55,449 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-11 14:55:55,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909957963] [2020-10-11 14:55:55,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:55,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:55:55,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557796971] [2020-10-11 14:55:55,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:55:55,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:55,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:55:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:55,451 INFO L87 Difference]: Start difference. First operand 654 states and 1764 transitions. Second operand 7 states. [2020-10-11 14:55:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:55,523 INFO L93 Difference]: Finished difference Result 616 states and 1687 transitions. [2020-10-11 14:55:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:55:55,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-11 14:55:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:55,524 INFO L225 Difference]: With dead ends: 616 [2020-10-11 14:55:55,525 INFO L226 Difference]: Without dead ends: 225 [2020-10-11 14:55:55,525 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:55:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-11 14:55:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2020-10-11 14:55:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-10-11 14:55:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 587 transitions. [2020-10-11 14:55:55,530 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 587 transitions. Word has length 22 [2020-10-11 14:55:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:55,531 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 587 transitions. [2020-10-11 14:55:55,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:55:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 587 transitions. [2020-10-11 14:55:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 14:55:55,532 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:55,532 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:55,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:55:55,532 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -250477544, now seen corresponding path program 1 times [2020-10-11 14:55:55,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:55,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130819167] [2020-10-11 14:55:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:55,793 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-11 14:55:55,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130819167] [2020-10-11 14:55:55,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:55,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:55:55,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417346111] [2020-10-11 14:55:55,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:55:55,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:55,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:55:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:55:55,795 INFO L87 Difference]: Start difference. First operand 225 states and 587 transitions. Second operand 9 states. [2020-10-11 14:55:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:55,910 INFO L93 Difference]: Finished difference Result 288 states and 732 transitions. [2020-10-11 14:55:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:55:55,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-11 14:55:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:55,912 INFO L225 Difference]: With dead ends: 288 [2020-10-11 14:55:55,912 INFO L226 Difference]: Without dead ends: 185 [2020-10-11 14:55:55,913 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:55:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-11 14:55:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-10-11 14:55:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-11 14:55:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 459 transitions. [2020-10-11 14:55:55,918 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 459 transitions. Word has length 26 [2020-10-11 14:55:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:55,918 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 459 transitions. [2020-10-11 14:55:55,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:55:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 459 transitions. [2020-10-11 14:55:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 14:55:55,919 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:55,920 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:55,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 14:55:55,920 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash -694662336, now seen corresponding path program 2 times [2020-10-11 14:55:55,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:55,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682480295] [2020-10-11 14:55:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:55:55,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:55:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:55:55,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:55:56,021 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:55:56,022 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:55:56,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 14:55:56,044 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-11 14:55:56,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,046 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-11 14:55:56,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,047 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-11 14:55:56,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,047 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-11 14:55:56,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,048 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-11 14:55:56,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,048 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-11 14:55:56,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,049 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-11 14:55:56,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,049 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-11 14:55:56,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,049 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-11 14:55:56,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,050 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-11 14:55:56,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,050 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-11 14:55:56,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,050 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-11 14:55:56,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,051 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-11 14:55:56,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,052 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-11 14:55:56,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,052 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-11 14:55:56,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,052 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-11 14:55:56,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,053 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-11 14:55:56,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,053 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-11 14:55:56,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,054 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-11 14:55:56,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,054 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-11 14:55:56,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,054 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-11 14:55:56,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,055 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-11 14:55:56,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,055 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-11 14:55:56,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,055 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-11 14:55:56,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,056 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-11 14:55:56,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,056 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-11 14:55:56,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,056 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-11 14:55:56,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,057 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-11 14:55:56,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,057 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-11 14:55:56,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:56,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:55:56 BasicIcfg [2020-10-11 14:55:56,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:55:56,167 INFO L168 Benchmark]: Toolchain (without parser) took 14028.10 ms. Allocated memory was 253.2 MB in the beginning and 575.7 MB in the end (delta: 322.4 MB). Free memory was 209.2 MB in the beginning and 198.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 333.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:56,167 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:55:56,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.31 ms. Allocated memory was 253.2 MB in the beginning and 319.3 MB in the end (delta: 66.1 MB). Free memory was 209.2 MB in the beginning and 269.5 MB in the end (delta: -60.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:56,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.62 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:56,175 INFO L168 Benchmark]: Boogie Preprocessor took 36.83 ms. Allocated memory is still 319.3 MB. Free memory was 267.0 MB in the beginning and 264.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:56,180 INFO L168 Benchmark]: RCFGBuilder took 2103.63 ms. Allocated memory was 319.3 MB in the beginning and 364.4 MB in the end (delta: 45.1 MB). Free memory was 264.4 MB in the beginning and 215.7 MB in the end (delta: 48.8 MB). Peak memory consumption was 99.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:56,181 INFO L168 Benchmark]: TraceAbstraction took 11036.24 ms. Allocated memory was 364.4 MB in the beginning and 575.7 MB in the end (delta: 211.3 MB). Free memory was 212.3 MB in the beginning and 198.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 225.3 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:56,187 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 780.31 ms. Allocated memory was 253.2 MB in the beginning and 319.3 MB in the end (delta: 66.1 MB). Free memory was 209.2 MB in the beginning and 269.5 MB in the end (delta: -60.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.62 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.83 ms. Allocated memory is still 319.3 MB. Free memory was 267.0 MB in the beginning and 264.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2103.63 ms. Allocated memory was 319.3 MB in the beginning and 364.4 MB in the end (delta: 45.1 MB). Free memory was 264.4 MB in the beginning and 215.7 MB in the end (delta: 48.8 MB). Peak memory consumption was 99.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11036.24 ms. Allocated memory was 364.4 MB in the beginning and 575.7 MB in the end (delta: 211.3 MB). Free memory was 212.3 MB in the beginning and 198.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 225.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1465 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 154 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 119 PlacesBefore, 45 PlacesAfterwards, 108 TransitionsBefore, 33 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 6555 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1477; [L826] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1478; [L828] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1479; [L830] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1480; [L832] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L838] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L841] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L841] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 499 SDtfs, 605 SDslu, 1028 SDs, 0 SdLazy, 373 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 64 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 23898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...