/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:42:06,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:42:06,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:42:06,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:42:06,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:42:06,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:42:06,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:42:06,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:42:06,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:42:06,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:42:06,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:42:06,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:42:06,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:42:06,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:42:06,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:42:06,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:42:06,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:42:06,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:42:06,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:42:07,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:42:07,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:42:07,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:42:07,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:42:07,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:42:07,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:42:07,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:42:07,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:42:07,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:42:07,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:42:07,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:42:07,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:42:07,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:42:07,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:42:07,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:42:07,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:42:07,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:42:07,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:42:07,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:42:07,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:42:07,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:42:07,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:42:07,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:42:07,084 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:42:07,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:42:07,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:42:07,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:42:07,088 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:42:07,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:42:07,088 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:42:07,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:42:07,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:42:07,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:42:07,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:42:07,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:42:07,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:42:07,091 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:42:07,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:42:07,092 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:42:07,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:42:07,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:42:07,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:42:07,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:42:07,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:42:07,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:42:07,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:42:07,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:42:07,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:42:07,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:42:07,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:42:07,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:42:07,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:42:07,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:42:07,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:42:07,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:42:07,455 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:42:07,456 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:42:07,456 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-10-05 23:42:07,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd0eb7aa/58de324cfab14cae9d730ed585832c86/FLAG92198c692 [2020-10-05 23:42:08,069 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:42:08,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-10-05 23:42:08,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd0eb7aa/58de324cfab14cae9d730ed585832c86/FLAG92198c692 [2020-10-05 23:42:08,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd0eb7aa/58de324cfab14cae9d730ed585832c86 [2020-10-05 23:42:08,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:42:08,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:42:08,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:08,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:42:08,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:42:08,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:08" (1/1) ... [2020-10-05 23:42:08,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cb694c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:08, skipping insertion in model container [2020-10-05 23:42:08,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:08" (1/1) ... [2020-10-05 23:42:08,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:42:08,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:42:08,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:09,009 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:42:09,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:09,138 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:42:09,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09 WrapperNode [2020-10-05 23:42:09,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:09,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:09,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:42:09,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:42:09,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:09,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:42:09,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:42:09,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:42:09,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... [2020-10-05 23:42:09,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:42:09,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:42:09,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:42:09,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:42:09,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:42:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:42:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:42:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:42:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:42:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:42:09,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:42:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:42:09,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:42:09,329 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:42:09,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:42:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:42:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:42:09,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:42:09,333 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:42:11,295 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:42:11,296 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:42:11,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:11 BoogieIcfgContainer [2020-10-05 23:42:11,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:42:11,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:42:11,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:42:11,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:42:11,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:42:08" (1/3) ... [2020-10-05 23:42:11,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c79a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:11, skipping insertion in model container [2020-10-05 23:42:11,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:09" (2/3) ... [2020-10-05 23:42:11,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c79a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:11, skipping insertion in model container [2020-10-05 23:42:11,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:11" (3/3) ... [2020-10-05 23:42:11,308 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2020-10-05 23:42:11,320 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:42:11,320 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:42:11,328 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:42:11,330 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:42:11,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,369 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,387 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,388 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:11,404 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:42:11,428 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:42:11,428 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:42:11,428 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:42:11,428 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:42:11,428 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:42:11,428 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:42:11,429 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:42:11,429 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:42:11,446 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-05 23:42:11,448 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-05 23:42:11,498 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-05 23:42:11,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:11,504 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-05 23:42:11,507 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-05 23:42:11,531 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-05 23:42:11,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:11,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-05 23:42:11,535 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1536 [2020-10-05 23:42:11,536 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:42:11,928 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:42:12,101 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:42:13,813 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-05 23:42:13,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-05 23:42:13,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:13,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:42:13,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:14,631 WARN L193 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-05 23:42:14,871 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:42:16,535 WARN L193 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-10-05 23:42:16,937 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-05 23:42:17,381 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:42:17,714 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:42:18,389 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2020-10-05 23:42:18,708 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-05 23:42:19,495 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:42:19,801 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:42:20,064 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 23:42:20,183 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:42:20,191 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3990 [2020-10-05 23:42:20,191 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-10-05 23:42:20,194 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-05 23:42:20,240 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-05 23:42:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-05 23:42:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:42:20,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:20,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:20,252 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1019465781, now seen corresponding path program 1 times [2020-10-05 23:42:20,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:20,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624267153] [2020-10-05 23:42:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:20,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624267153] [2020-10-05 23:42:20,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:20,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:20,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978122336] [2020-10-05 23:42:20,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:20,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:20,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:20,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:20,561 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-05 23:42:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:20,704 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-05 23:42:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:20,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:42:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:20,729 INFO L225 Difference]: With dead ends: 550 [2020-10-05 23:42:20,729 INFO L226 Difference]: Without dead ends: 450 [2020-10-05 23:42:20,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-05 23:42:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-05 23:42:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-05 23:42:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-05 23:42:20,848 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-05 23:42:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:20,849 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-05 23:42:20,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-05 23:42:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:20,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:20,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:20,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:42:20,854 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash 454120523, now seen corresponding path program 1 times [2020-10-05 23:42:20,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:20,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073145864] [2020-10-05 23:42:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:20,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073145864] [2020-10-05 23:42:21,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:21,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:21,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101642278] [2020-10-05 23:42:21,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:21,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:21,003 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-05 23:42:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:21,018 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-05 23:42:21,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:21,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:42:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:21,026 INFO L225 Difference]: With dead ends: 440 [2020-10-05 23:42:21,026 INFO L226 Difference]: Without dead ends: 440 [2020-10-05 23:42:21,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-05 23:42:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-05 23:42:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-05 23:42:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-05 23:42:21,062 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-05 23:42:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:21,062 INFO L479 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-05 23:42:21,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-05 23:42:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:42:21,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:21,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:21,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:42:21,065 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash 660752975, now seen corresponding path program 1 times [2020-10-05 23:42:21,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:21,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391676222] [2020-10-05 23:42:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:21,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391676222] [2020-10-05 23:42:21,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:21,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:21,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109713096] [2020-10-05 23:42:21,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:21,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:21,173 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-05 23:42:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:21,203 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-05 23:42:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:21,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:42:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:21,209 INFO L225 Difference]: With dead ends: 434 [2020-10-05 23:42:21,210 INFO L226 Difference]: Without dead ends: 434 [2020-10-05 23:42:21,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-05 23:42:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-05 23:42:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-05 23:42:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-05 23:42:21,236 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-05 23:42:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:21,236 INFO L479 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-05 23:42:21,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-05 23:42:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:42:21,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:21,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:21,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:42:21,239 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash -991494548, now seen corresponding path program 1 times [2020-10-05 23:42:21,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:21,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872642251] [2020-10-05 23:42:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:21,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872642251] [2020-10-05 23:42:21,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:21,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:21,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29747023] [2020-10-05 23:42:21,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:21,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:21,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:21,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:21,420 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-10-05 23:42:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:21,482 INFO L93 Difference]: Finished difference Result 420 states and 1246 transitions. [2020-10-05 23:42:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:21,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-05 23:42:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:21,487 INFO L225 Difference]: With dead ends: 420 [2020-10-05 23:42:21,488 INFO L226 Difference]: Without dead ends: 420 [2020-10-05 23:42:21,488 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-05 23:42:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-05 23:42:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-05 23:42:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1246 transitions. [2020-10-05 23:42:21,503 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1246 transitions. Word has length 11 [2020-10-05 23:42:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:21,503 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1246 transitions. [2020-10-05 23:42:21,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1246 transitions. [2020-10-05 23:42:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:42:21,506 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:21,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:21,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:42:21,506 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 350943551, now seen corresponding path program 1 times [2020-10-05 23:42:21,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:21,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610399945] [2020-10-05 23:42:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:21,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610399945] [2020-10-05 23:42:21,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:21,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:21,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152328507] [2020-10-05 23:42:21,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:21,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:21,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:21,655 INFO L87 Difference]: Start difference. First operand 420 states and 1246 transitions. Second operand 5 states. [2020-10-05 23:42:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:21,746 INFO L93 Difference]: Finished difference Result 452 states and 1330 transitions. [2020-10-05 23:42:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:21,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:42:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:21,752 INFO L225 Difference]: With dead ends: 452 [2020-10-05 23:42:21,752 INFO L226 Difference]: Without dead ends: 452 [2020-10-05 23:42:21,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-05 23:42:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-05 23:42:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-05 23:42:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1330 transitions. [2020-10-05 23:42:21,770 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1330 transitions. Word has length 12 [2020-10-05 23:42:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:21,771 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1330 transitions. [2020-10-05 23:42:21,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1330 transitions. [2020-10-05 23:42:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:42:21,772 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:21,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:21,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:42:21,773 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash -442809329, now seen corresponding path program 1 times [2020-10-05 23:42:21,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:21,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599957584] [2020-10-05 23:42:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:21,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599957584] [2020-10-05 23:42:21,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:21,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:21,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440371775] [2020-10-05 23:42:21,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:21,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:21,842 INFO L87 Difference]: Start difference. First operand 452 states and 1330 transitions. Second operand 5 states. [2020-10-05 23:42:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:21,920 INFO L93 Difference]: Finished difference Result 611 states and 1752 transitions. [2020-10-05 23:42:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:21,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:42:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:21,924 INFO L225 Difference]: With dead ends: 611 [2020-10-05 23:42:21,924 INFO L226 Difference]: Without dead ends: 410 [2020-10-05 23:42:21,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-05 23:42:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 392. [2020-10-05 23:42:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-10-05 23:42:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-10-05 23:42:21,941 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 12 [2020-10-05 23:42:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:21,941 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-10-05 23:42:21,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-10-05 23:42:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:42:21,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:21,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:21,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:42:21,943 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -842166617, now seen corresponding path program 1 times [2020-10-05 23:42:21,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:21,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242370025] [2020-10-05 23:42:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:22,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242370025] [2020-10-05 23:42:22,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:22,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:22,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304445798] [2020-10-05 23:42:22,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:22,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:22,012 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-10-05 23:42:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:22,051 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-10-05 23:42:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:22,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:42:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:22,054 INFO L225 Difference]: With dead ends: 384 [2020-10-05 23:42:22,054 INFO L226 Difference]: Without dead ends: 280 [2020-10-05 23:42:22,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-05 23:42:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-05 23:42:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-05 23:42:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-10-05 23:42:22,064 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-10-05 23:42:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:22,065 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-10-05 23:42:22,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-10-05 23:42:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:22,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:22,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:22,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:42:22,066 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash -711911559, now seen corresponding path program 1 times [2020-10-05 23:42:22,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:22,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220621503] [2020-10-05 23:42:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:22,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220621503] [2020-10-05 23:42:22,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:22,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:22,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829244455] [2020-10-05 23:42:22,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:22,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:22,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:22,141 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-10-05 23:42:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:22,189 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-10-05 23:42:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:22,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:42:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:22,191 INFO L225 Difference]: With dead ends: 230 [2020-10-05 23:42:22,191 INFO L226 Difference]: Without dead ends: 176 [2020-10-05 23:42:22,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-05 23:42:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-05 23:42:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-05 23:42:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-05 23:42:22,197 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-05 23:42:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:22,198 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-05 23:42:22,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-05 23:42:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:22,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:22,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:22,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:42:22,199 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1312231858, now seen corresponding path program 1 times [2020-10-05 23:42:22,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:22,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563097370] [2020-10-05 23:42:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:22,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563097370] [2020-10-05 23:42:22,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:22,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:22,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678715578] [2020-10-05 23:42:22,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:22,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:22,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:22,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:22,278 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-10-05 23:42:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:22,332 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-10-05 23:42:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:22,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:42:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:22,334 INFO L225 Difference]: With dead ends: 157 [2020-10-05 23:42:22,334 INFO L226 Difference]: Without dead ends: 97 [2020-10-05 23:42:22,335 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-05 23:42:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-10-05 23:42:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-05 23:42:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-05 23:42:22,338 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-05 23:42:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:22,338 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-05 23:42:22,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-05 23:42:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:42:22,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:22,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:22,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:42:22,340 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1503762436, now seen corresponding path program 1 times [2020-10-05 23:42:22,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:22,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398664254] [2020-10-05 23:42:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:22,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398664254] [2020-10-05 23:42:22,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:22,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:22,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432705117] [2020-10-05 23:42:22,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:22,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:22,401 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 4 states. [2020-10-05 23:42:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:22,420 INFO L93 Difference]: Finished difference Result 113 states and 224 transitions. [2020-10-05 23:42:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:22,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-05 23:42:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:22,422 INFO L225 Difference]: With dead ends: 113 [2020-10-05 23:42:22,422 INFO L226 Difference]: Without dead ends: 47 [2020-10-05 23:42:22,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-05 23:42:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-05 23:42:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-05 23:42:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-05 23:42:22,424 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-05 23:42:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:22,425 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-05 23:42:22,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-05 23:42:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:42:22,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:22,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:22,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:42:22,426 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1669447360, now seen corresponding path program 2 times [2020-10-05 23:42:22,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:22,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169426423] [2020-10-05 23:42:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:22,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169426423] [2020-10-05 23:42:22,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:22,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:22,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472292964] [2020-10-05 23:42:22,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:22,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:22,606 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 7 states. [2020-10-05 23:42:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:22,713 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-10-05 23:42:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:22,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 23:42:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:22,714 INFO L225 Difference]: With dead ends: 61 [2020-10-05 23:42:22,715 INFO L226 Difference]: Without dead ends: 35 [2020-10-05 23:42:22,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-05 23:42:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-05 23:42:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-05 23:42:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-05 23:42:22,718 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-10-05 23:42:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:22,719 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-05 23:42:22,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-05 23:42:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:42:22,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:22,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:22,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:42:22,720 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1311498048, now seen corresponding path program 3 times [2020-10-05 23:42:22,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:22,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658258571] [2020-10-05 23:42:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:22,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:22,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:22,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:42:22,849 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:42:22,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:42:22,850 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:42:22,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L813-->L820: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In653227082 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In653227082 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In653227082 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In653227082 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_Out653227082 ~y$r_buff1_thd0~0_In653227082) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out653227082 0)) (or (and (= ~y$w_buff1_used~0_In653227082 ~y$w_buff1_used~0_Out653227082) .cse0) (and .cse1 .cse2 (= 0 ~y$w_buff1_used~0_Out653227082))) (= ~y$r_buff0_thd0~0_Out653227082 ~y$r_buff0_thd0~0_In653227082) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In653227082| ULTIMATE.start_assume_abort_if_not_~cond_Out653227082) (or (and (or (and (= ~y~0_Out653227082 ~y$w_buff1~0_In653227082) .cse1 .cse2) (and (= ~y~0_Out653227082 ~y~0_In653227082) .cse0)) .cse3) (and .cse4 (= ~y$w_buff0~0_In653227082 ~y~0_Out653227082) .cse5)) (or (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out653227082 0)) (and (= ~y$w_buff0_used~0_In653227082 ~y$w_buff0_used~0_Out653227082) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In653227082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In653227082, ~y$w_buff1~0=~y$w_buff1~0_In653227082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In653227082, ~y$w_buff0~0=~y$w_buff0~0_In653227082, ~y~0=~y~0_In653227082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In653227082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In653227082} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out653227082, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out653227082|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out653227082|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out653227082|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out653227082|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out653227082|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out653227082|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In653227082|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out653227082, ~y$w_buff1~0=~y$w_buff1~0_In653227082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out653227082, ~y$w_buff0~0=~y$w_buff0~0_In653227082, ~y~0=~y~0_Out653227082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out653227082, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out653227082} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:42:22,876 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,911 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,911 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,914 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,914 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,915 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,915 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,915 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,916 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,916 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:22,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:22,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:42:22 BasicIcfg [2020-10-05 23:42:22,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:42:22,968 INFO L168 Benchmark]: Toolchain (without parser) took 14623.19 ms. Allocated memory was 150.5 MB in the beginning and 368.1 MB in the end (delta: 217.6 MB). Free memory was 104.7 MB in the beginning and 321.3 MB in the end (delta: -216.5 MB). Peak memory consumption was 198.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,969 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 150.5 MB. Free memory was 125.2 MB in the beginning and 124.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.56 ms. Allocated memory was 150.5 MB in the beginning and 206.6 MB in the end (delta: 56.1 MB). Free memory was 104.5 MB in the beginning and 160.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.44 ms. Allocated memory is still 206.6 MB. Free memory was 160.5 MB in the beginning and 157.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,974 INFO L168 Benchmark]: Boogie Preprocessor took 37.32 ms. Allocated memory is still 206.6 MB. Free memory was 157.5 MB in the beginning and 155.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,974 INFO L168 Benchmark]: RCFGBuilder took 2040.83 ms. Allocated memory was 206.6 MB in the beginning and 242.2 MB in the end (delta: 35.7 MB). Free memory was 155.0 MB in the beginning and 162.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,978 INFO L168 Benchmark]: TraceAbstraction took 11667.11 ms. Allocated memory was 242.2 MB in the beginning and 368.1 MB in the end (delta: 125.8 MB). Free memory was 162.2 MB in the beginning and 321.3 MB in the end (delta: -159.0 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:22,985 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.18 ms. Allocated memory is still 150.5 MB. Free memory was 125.2 MB in the beginning and 124.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.56 ms. Allocated memory was 150.5 MB in the beginning and 206.6 MB in the end (delta: 56.1 MB). Free memory was 104.5 MB in the beginning and 160.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.44 ms. Allocated memory is still 206.6 MB. Free memory was 160.5 MB in the beginning and 157.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.32 ms. Allocated memory is still 206.6 MB. Free memory was 157.5 MB in the beginning and 155.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2040.83 ms. Allocated memory was 206.6 MB in the beginning and 242.2 MB in the end (delta: 35.7 MB). Free memory was 155.0 MB in the beginning and 162.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11667.11 ms. Allocated memory was 242.2 MB in the beginning and 368.1 MB in the end (delta: 125.8 MB). Free memory was 162.2 MB in the beginning and 321.3 MB in the end (delta: -159.0 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.7s, 99 ProgramPointsBefore, 35 ProgramPointsAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 787 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3990 CheckedPairsTotal, 77 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L804] 0 pthread_t t2522; [L805] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t2523; [L807] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 0 pthread_t t2524; [L809] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L753] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L826] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L829] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L829] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L831] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L832] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 235 SDtfs, 290 SDslu, 324 SDs, 0 SdLazy, 186 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 11787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...