/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:04:49,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:04:49,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:04:49,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:04:49,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:04:49,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:04:49,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:04:49,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:04:49,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:04:49,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:04:49,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:04:49,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:04:49,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:04:49,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:04:49,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:04:49,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:04:49,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:04:49,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:04:49,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:04:49,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:04:49,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:04:49,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:04:49,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:04:49,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:04:49,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:04:49,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:04:49,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:04:49,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:04:49,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:04:49,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:04:49,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:04:49,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:04:49,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:04:49,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:04:49,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:04:49,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:04:49,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:04:49,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:04:49,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:04:49,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:04:49,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:04:49,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:04:49,206 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:04:49,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:04:49,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:04:49,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:04:49,208 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:04:49,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:04:49,208 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:04:49,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:04:49,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:04:49,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:04:49,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:04:49,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:04:49,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:04:49,210 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:04:49,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:04:49,210 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:04:49,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:04:49,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:04:49,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:04:49,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:04:49,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:04:49,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:49,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:04:49,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:04:49,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:04:49,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:04:49,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:04:49,212 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:04:49,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:04:49,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:04:49,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:04:49,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:04:49,524 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:04:49,525 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:04:49,526 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-16 12:04:49,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cc1840a9c/ade02b7197954582830d1d2ccc01e9ce/FLAG8d9c00a94 [2020-10-16 12:04:50,139 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:04:50,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-16 12:04:50,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cc1840a9c/ade02b7197954582830d1d2ccc01e9ce/FLAG8d9c00a94 [2020-10-16 12:04:50,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cc1840a9c/ade02b7197954582830d1d2ccc01e9ce [2020-10-16 12:04:50,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:04:50,409 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:04:50,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:50,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:04:50,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:04:50,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:50" (1/1) ... [2020-10-16 12:04:50,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7aa1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:50, skipping insertion in model container [2020-10-16 12:04:50,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:50" (1/1) ... [2020-10-16 12:04:50,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:04:50,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:04:50,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:50,954 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:04:51,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:51,110 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:04:51,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51 WrapperNode [2020-10-16 12:04:51,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:51,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:51,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:04:51,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:04:51,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:51,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:04:51,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:04:51,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:04:51,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... [2020-10-16 12:04:51,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:04:51,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:04:51,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:04:51,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:04:51,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:04:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:04:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:04:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:04:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:04:51,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:04:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:04:51,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:04:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:04:51,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:04:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:04:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:04:51,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:04:51,336 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:04:53,152 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:04:53,152 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:04:53,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:53 BoogieIcfgContainer [2020-10-16 12:04:53,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:04:53,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:04:53,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:04:53,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:04:53,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:50" (1/3) ... [2020-10-16 12:04:53,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33687fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:53, skipping insertion in model container [2020-10-16 12:04:53,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:51" (2/3) ... [2020-10-16 12:04:53,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33687fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:53, skipping insertion in model container [2020-10-16 12:04:53,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:53" (3/3) ... [2020-10-16 12:04:53,167 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2020-10-16 12:04:53,180 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:04:53,180 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:04:53,190 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:04:53,191 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:04:53,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,232 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,236 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,247 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,248 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,254 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,254 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,255 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,261 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:53,262 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:04:53,278 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:04:53,299 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:04:53,299 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:04:53,299 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:04:53,300 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:04:53,300 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:04:53,300 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:04:53,300 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:04:53,300 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:04:53,321 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:04:53,322 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:04:53,324 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:04:53,326 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 12:04:53,373 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 12:04:53,373 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:04:53,378 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 12:04:53,381 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 12:04:53,880 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:04:53,996 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:04:54,859 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:04:54,966 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:04:56,339 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 12:04:56,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 12:04:56,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:56,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:04:56,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:57,069 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2020-10-16 12:04:58,138 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 12:04:58,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 12:04:58,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:58,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:04:58,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:58,857 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 12:05:00,393 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 12:05:00,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:05:00,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:00,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:05:00,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:01,515 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 12:05:01,808 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:05:01,927 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:05:01,933 INFO L132 LiptonReduction]: Checked pairs total: 4174 [2020-10-16 12:05:01,933 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 12:05:01,939 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 12:05:01,992 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 12:05:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 12:05:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:05:02,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:02,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:02,002 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1913445642, now seen corresponding path program 1 times [2020-10-16 12:05:02,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:02,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078514772] [2020-10-16 12:05:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:02,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078514772] [2020-10-16 12:05:02,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:02,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:02,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398129879] [2020-10-16 12:05:02,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:02,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:02,292 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 12:05:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:02,413 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 12:05:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:02,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:05:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:02,435 INFO L225 Difference]: With dead ends: 550 [2020-10-16 12:05:02,436 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 12:05:02,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 12:05:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 12:05:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 12:05:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 12:05:02,571 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 12:05:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:02,572 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 12:05:02,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 12:05:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:05:02,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:02,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:02,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:05:02,577 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash 575294358, now seen corresponding path program 1 times [2020-10-16 12:05:02,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:02,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244787547] [2020-10-16 12:05:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:02,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244787547] [2020-10-16 12:05:02,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:02,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:02,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064194729] [2020-10-16 12:05:02,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:02,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:02,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:02,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:02,720 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 12:05:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:02,749 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 12:05:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:02,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:05:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:02,760 INFO L225 Difference]: With dead ends: 440 [2020-10-16 12:05:02,761 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 12:05:02,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 12:05:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 12:05:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 12:05:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 12:05:02,788 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 12:05:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:02,788 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 12:05:02,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 12:05:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:05:02,790 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:02,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:02,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:05:02,791 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 654255379, now seen corresponding path program 1 times [2020-10-16 12:05:02,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:02,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84724828] [2020-10-16 12:05:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:02,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84724828] [2020-10-16 12:05:02,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:02,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:02,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919262826] [2020-10-16 12:05:02,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:02,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:02,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:02,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:02,886 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-16 12:05:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:02,912 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-16 12:05:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:02,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:05:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:02,916 INFO L225 Difference]: With dead ends: 434 [2020-10-16 12:05:02,917 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 12:05:02,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 12:05:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 12:05:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 12:05:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-16 12:05:02,932 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-16 12:05:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:02,932 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-16 12:05:02,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-16 12:05:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:02,934 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:02,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:02,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:05:02,935 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1192921599, now seen corresponding path program 1 times [2020-10-16 12:05:02,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:02,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172470466] [2020-10-16 12:05:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:03,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172470466] [2020-10-16 12:05:03,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:03,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:03,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469081964] [2020-10-16 12:05:03,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:03,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:03,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:03,022 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 4 states. [2020-10-16 12:05:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:03,082 INFO L93 Difference]: Finished difference Result 438 states and 1309 transitions. [2020-10-16 12:05:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:03,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:05:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:03,086 INFO L225 Difference]: With dead ends: 438 [2020-10-16 12:05:03,087 INFO L226 Difference]: Without dead ends: 438 [2020-10-16 12:05:03,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-16 12:05:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2020-10-16 12:05:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-16 12:05:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1309 transitions. [2020-10-16 12:05:03,102 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1309 transitions. Word has length 11 [2020-10-16 12:05:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:03,103 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1309 transitions. [2020-10-16 12:05:03,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1309 transitions. [2020-10-16 12:05:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:03,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:03,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:03,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:05:03,105 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:03,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1192920235, now seen corresponding path program 1 times [2020-10-16 12:05:03,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:03,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663510100] [2020-10-16 12:05:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:03,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663510100] [2020-10-16 12:05:03,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:03,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:03,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767577012] [2020-10-16 12:05:03,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:03,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:03,314 INFO L87 Difference]: Start difference. First operand 438 states and 1309 transitions. Second operand 5 states. [2020-10-16 12:05:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:03,398 INFO L93 Difference]: Finished difference Result 426 states and 1265 transitions. [2020-10-16 12:05:03,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:03,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:05:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:03,406 INFO L225 Difference]: With dead ends: 426 [2020-10-16 12:05:03,406 INFO L226 Difference]: Without dead ends: 426 [2020-10-16 12:05:03,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-16 12:05:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-16 12:05:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 12:05:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1265 transitions. [2020-10-16 12:05:03,421 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1265 transitions. Word has length 11 [2020-10-16 12:05:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:03,421 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1265 transitions. [2020-10-16 12:05:03,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1265 transitions. [2020-10-16 12:05:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:03,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:03,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:03,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:05:03,426 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1194181749, now seen corresponding path program 2 times [2020-10-16 12:05:03,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:03,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971759973] [2020-10-16 12:05:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:03,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971759973] [2020-10-16 12:05:03,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:03,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:03,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296448497] [2020-10-16 12:05:03,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:03,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:03,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:03,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:03,572 INFO L87 Difference]: Start difference. First operand 426 states and 1265 transitions. Second operand 5 states. [2020-10-16 12:05:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:03,676 INFO L93 Difference]: Finished difference Result 422 states and 1250 transitions. [2020-10-16 12:05:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:03,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:05:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:03,680 INFO L225 Difference]: With dead ends: 422 [2020-10-16 12:05:03,680 INFO L226 Difference]: Without dead ends: 422 [2020-10-16 12:05:03,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-16 12:05:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2020-10-16 12:05:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-16 12:05:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1239 transitions. [2020-10-16 12:05:03,695 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1239 transitions. Word has length 11 [2020-10-16 12:05:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:03,695 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1239 transitions. [2020-10-16 12:05:03,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:03,695 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1239 transitions. [2020-10-16 12:05:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:03,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:03,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:03,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:05:03,697 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:03,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1674134258, now seen corresponding path program 1 times [2020-10-16 12:05:03,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:03,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319759852] [2020-10-16 12:05:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:03,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319759852] [2020-10-16 12:05:03,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:03,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:03,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672346972] [2020-10-16 12:05:03,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:03,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:03,829 INFO L87 Difference]: Start difference. First operand 418 states and 1239 transitions. Second operand 5 states. [2020-10-16 12:05:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:03,887 INFO L93 Difference]: Finished difference Result 414 states and 1224 transitions. [2020-10-16 12:05:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:03,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:05:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:03,891 INFO L225 Difference]: With dead ends: 414 [2020-10-16 12:05:03,892 INFO L226 Difference]: Without dead ends: 414 [2020-10-16 12:05:03,892 INFO L677 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-16 12:05:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-16 12:05:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2020-10-16 12:05:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 12:05:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1213 transitions. [2020-10-16 12:05:03,911 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1213 transitions. Word has length 12 [2020-10-16 12:05:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:03,912 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1213 transitions. [2020-10-16 12:05:03,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1213 transitions. [2020-10-16 12:05:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:03,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:03,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:03,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:05:03,914 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1674135591, now seen corresponding path program 1 times [2020-10-16 12:05:03,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:03,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811676598] [2020-10-16 12:05:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:04,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811676598] [2020-10-16 12:05:04,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:04,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:04,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956158950] [2020-10-16 12:05:04,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:04,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:04,129 INFO L87 Difference]: Start difference. First operand 410 states and 1213 transitions. Second operand 6 states. [2020-10-16 12:05:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:04,262 INFO L93 Difference]: Finished difference Result 478 states and 1432 transitions. [2020-10-16 12:05:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:04,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-16 12:05:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:04,268 INFO L225 Difference]: With dead ends: 478 [2020-10-16 12:05:04,268 INFO L226 Difference]: Without dead ends: 478 [2020-10-16 12:05:04,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-16 12:05:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 438. [2020-10-16 12:05:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-16 12:05:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1306 transitions. [2020-10-16 12:05:04,292 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1306 transitions. Word has length 12 [2020-10-16 12:05:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:04,293 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1306 transitions. [2020-10-16 12:05:04,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1306 transitions. [2020-10-16 12:05:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:04,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:04,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:04,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:05:04,295 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1674176511, now seen corresponding path program 2 times [2020-10-16 12:05:04,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:04,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432980836] [2020-10-16 12:05:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:04,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432980836] [2020-10-16 12:05:04,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:04,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:04,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829074766] [2020-10-16 12:05:04,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:04,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:04,486 INFO L87 Difference]: Start difference. First operand 438 states and 1306 transitions. Second operand 6 states. [2020-10-16 12:05:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:04,594 INFO L93 Difference]: Finished difference Result 462 states and 1364 transitions. [2020-10-16 12:05:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:04,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-16 12:05:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:04,599 INFO L225 Difference]: With dead ends: 462 [2020-10-16 12:05:04,599 INFO L226 Difference]: Without dead ends: 462 [2020-10-16 12:05:04,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2020-10-16 12:05:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 426. [2020-10-16 12:05:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 12:05:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1253 transitions. [2020-10-16 12:05:04,615 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1253 transitions. Word has length 12 [2020-10-16 12:05:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:04,616 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1253 transitions. [2020-10-16 12:05:04,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1253 transitions. [2020-10-16 12:05:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:04,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:04,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:04,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:05:04,617 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash 358553942, now seen corresponding path program 1 times [2020-10-16 12:05:04,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:04,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237861342] [2020-10-16 12:05:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:04,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237861342] [2020-10-16 12:05:04,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:04,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:04,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102209864] [2020-10-16 12:05:04,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:04,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:04,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:04,896 INFO L87 Difference]: Start difference. First operand 426 states and 1253 transitions. Second operand 7 states. [2020-10-16 12:05:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:05,016 INFO L93 Difference]: Finished difference Result 510 states and 1504 transitions. [2020-10-16 12:05:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:05,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 12:05:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:05,020 INFO L225 Difference]: With dead ends: 510 [2020-10-16 12:05:05,020 INFO L226 Difference]: Without dead ends: 510 [2020-10-16 12:05:05,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-10-16 12:05:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 486. [2020-10-16 12:05:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-16 12:05:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1422 transitions. [2020-10-16 12:05:05,036 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1422 transitions. Word has length 13 [2020-10-16 12:05:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:05,036 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1422 transitions. [2020-10-16 12:05:05,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1422 transitions. [2020-10-16 12:05:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:05,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:05,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:05,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:05:05,038 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 358593932, now seen corresponding path program 2 times [2020-10-16 12:05:05,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:05,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713169153] [2020-10-16 12:05:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:05,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713169153] [2020-10-16 12:05:05,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:05,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:05,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795572746] [2020-10-16 12:05:05,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:05,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:05,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:05,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:05,359 INFO L87 Difference]: Start difference. First operand 486 states and 1422 transitions. Second operand 7 states. [2020-10-16 12:05:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:05,498 INFO L93 Difference]: Finished difference Result 558 states and 1644 transitions. [2020-10-16 12:05:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:05,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 12:05:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:05,503 INFO L225 Difference]: With dead ends: 558 [2020-10-16 12:05:05,503 INFO L226 Difference]: Without dead ends: 558 [2020-10-16 12:05:05,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-16 12:05:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 510. [2020-10-16 12:05:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-10-16 12:05:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1504 transitions. [2020-10-16 12:05:05,520 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1504 transitions. Word has length 13 [2020-10-16 12:05:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:05,520 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 1504 transitions. [2020-10-16 12:05:05,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1504 transitions. [2020-10-16 12:05:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:05,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:05,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:05,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:05:05,522 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash 359862452, now seen corresponding path program 3 times [2020-10-16 12:05:05,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:05,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448240878] [2020-10-16 12:05:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:05,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448240878] [2020-10-16 12:05:05,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:05,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:05,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749093379] [2020-10-16 12:05:05,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:05,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:05,886 INFO L87 Difference]: Start difference. First operand 510 states and 1504 transitions. Second operand 7 states. [2020-10-16 12:05:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:06,095 INFO L93 Difference]: Finished difference Result 566 states and 1614 transitions. [2020-10-16 12:05:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:06,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 12:05:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:06,100 INFO L225 Difference]: With dead ends: 566 [2020-10-16 12:05:06,100 INFO L226 Difference]: Without dead ends: 494 [2020-10-16 12:05:06,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-16 12:05:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 386. [2020-10-16 12:05:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-16 12:05:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1107 transitions. [2020-10-16 12:05:06,113 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1107 transitions. Word has length 13 [2020-10-16 12:05:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:06,113 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 1107 transitions. [2020-10-16 12:05:06,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1107 transitions. [2020-10-16 12:05:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:06,114 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:06,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:06,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:05:06,115 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash 359870388, now seen corresponding path program 1 times [2020-10-16 12:05:06,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:06,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405048647] [2020-10-16 12:05:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:06,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405048647] [2020-10-16 12:05:06,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:06,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:06,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733806916] [2020-10-16 12:05:06,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:06,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:06,181 INFO L87 Difference]: Start difference. First operand 386 states and 1107 transitions. Second operand 4 states. [2020-10-16 12:05:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:06,209 INFO L93 Difference]: Finished difference Result 380 states and 964 transitions. [2020-10-16 12:05:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:06,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:05:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:06,212 INFO L225 Difference]: With dead ends: 380 [2020-10-16 12:05:06,212 INFO L226 Difference]: Without dead ends: 280 [2020-10-16 12:05:06,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-16 12:05:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-16 12:05:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-16 12:05:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 689 transitions. [2020-10-16 12:05:06,219 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 689 transitions. Word has length 13 [2020-10-16 12:05:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:06,220 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 689 transitions. [2020-10-16 12:05:06,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 689 transitions. [2020-10-16 12:05:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:05:06,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:06,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:06,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:05:06,221 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:06,221 INFO L82 PathProgramCache]: Analyzing trace with hash -664427399, now seen corresponding path program 1 times [2020-10-16 12:05:06,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:06,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076302622] [2020-10-16 12:05:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:06,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076302622] [2020-10-16 12:05:06,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:06,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:06,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844839639] [2020-10-16 12:05:06,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:06,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:06,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:06,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:06,293 INFO L87 Difference]: Start difference. First operand 280 states and 689 transitions. Second operand 5 states. [2020-10-16 12:05:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:06,335 INFO L93 Difference]: Finished difference Result 235 states and 532 transitions. [2020-10-16 12:05:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:06,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:05:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:06,337 INFO L225 Difference]: With dead ends: 235 [2020-10-16 12:05:06,337 INFO L226 Difference]: Without dead ends: 183 [2020-10-16 12:05:06,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-16 12:05:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-16 12:05:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-16 12:05:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 406 transitions. [2020-10-16 12:05:06,343 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 406 transitions. Word has length 14 [2020-10-16 12:05:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:06,343 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 406 transitions. [2020-10-16 12:05:06,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 406 transitions. [2020-10-16 12:05:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:06,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:06,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:06,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:05:06,345 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 329564957, now seen corresponding path program 1 times [2020-10-16 12:05:06,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:06,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863680194] [2020-10-16 12:05:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:06,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863680194] [2020-10-16 12:05:06,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:06,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:06,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117762004] [2020-10-16 12:05:06,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:06,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:06,378 INFO L87 Difference]: Start difference. First operand 183 states and 406 transitions. Second operand 3 states. [2020-10-16 12:05:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:06,388 INFO L93 Difference]: Finished difference Result 258 states and 551 transitions. [2020-10-16 12:05:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:06,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 12:05:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:06,391 INFO L225 Difference]: With dead ends: 258 [2020-10-16 12:05:06,392 INFO L226 Difference]: Without dead ends: 180 [2020-10-16 12:05:06,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-16 12:05:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2020-10-16 12:05:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-16 12:05:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 364 transitions. [2020-10-16 12:05:06,398 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 364 transitions. Word has length 16 [2020-10-16 12:05:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:06,399 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 364 transitions. [2020-10-16 12:05:06,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 364 transitions. [2020-10-16 12:05:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:05:06,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:06,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:06,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:05:06,401 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:06,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -85316920, now seen corresponding path program 1 times [2020-10-16 12:05:06,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:06,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410412835] [2020-10-16 12:05:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:06,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410412835] [2020-10-16 12:05:06,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:06,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:06,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764977188] [2020-10-16 12:05:06,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:06,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:06,493 INFO L87 Difference]: Start difference. First operand 178 states and 364 transitions. Second operand 6 states. [2020-10-16 12:05:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:06,564 INFO L93 Difference]: Finished difference Result 161 states and 330 transitions. [2020-10-16 12:05:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:06,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:05:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:06,567 INFO L225 Difference]: With dead ends: 161 [2020-10-16 12:05:06,567 INFO L226 Difference]: Without dead ends: 85 [2020-10-16 12:05:06,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-16 12:05:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-16 12:05:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-16 12:05:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 168 transitions. [2020-10-16 12:05:06,570 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 168 transitions. Word has length 17 [2020-10-16 12:05:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:06,570 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 168 transitions. [2020-10-16 12:05:06,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 168 transitions. [2020-10-16 12:05:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:05:06,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:06,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:06,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:05:06,572 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1585187057, now seen corresponding path program 1 times [2020-10-16 12:05:06,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:06,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892622522] [2020-10-16 12:05:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:06,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:06,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:06,693 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:05:06,693 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:05:06,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:05:06,694 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:05:06,710 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L810-->L818: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In127785279 256) 0)) (.cse7 (= (mod ~y$r_buff1_thd0~0_In127785279 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In127785279 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In127785279 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse1 (or .cse6 .cse7)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (and .cse0 (or (and .cse1 (= ~y~0_Out127785279 ~y~0_In127785279)) (and .cse2 (= ~y~0_Out127785279 ~y$w_buff1~0_In127785279) .cse3))) (and (= ~y$w_buff0~0_In127785279 ~y~0_Out127785279) .cse4 .cse5)) (= ~y$r_buff1_thd0~0_Out127785279 ~y$r_buff1_thd0~0_In127785279) (= ULTIMATE.start_assume_abort_if_not_~cond_Out127785279 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out127785279|) (= (mod ~main$tmp_guard0~0_In127785279 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out127785279|) (or (and .cse4 (= ~y$w_buff0_used~0_Out127785279 0) .cse5) (and .cse0 (= ~y$w_buff0_used~0_In127785279 ~y$w_buff0_used~0_Out127785279))) (= ~y$r_buff0_thd0~0_Out127785279 ~y$r_buff0_thd0~0_In127785279) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out127785279 0)) (or (and .cse1 (= ~y$w_buff1_used~0_In127785279 ~y$w_buff1_used~0_Out127785279)) (and .cse2 .cse3 (= ~y$w_buff1_used~0_Out127785279 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In127785279, ~y$w_buff1~0=~y$w_buff1~0_In127785279, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In127785279, ~y$w_buff0~0=~y$w_buff0~0_In127785279, ~main$tmp_guard0~0=~main$tmp_guard0~0_In127785279, ~y~0=~y~0_In127785279, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In127785279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In127785279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out127785279, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out127785279|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out127785279|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out127785279|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In127785279, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out127785279|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out127785279|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out127785279|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out127785279|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out127785279, ~y$w_buff1~0=~y$w_buff1~0_In127785279, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out127785279, ~y$w_buff0~0=~y$w_buff0~0_In127785279, ~y~0=~y~0_Out127785279, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out127785279, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out127785279} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:05:06,716 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,718 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,718 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:06,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:06,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:05:06 BasicIcfg [2020-10-16 12:05:06,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:05:06,783 INFO L168 Benchmark]: Toolchain (without parser) took 16373.80 ms. Allocated memory was 147.8 MB in the beginning and 376.4 MB in the end (delta: 228.6 MB). Free memory was 102.3 MB in the beginning and 149.4 MB in the end (delta: -47.1 MB). Peak memory consumption was 181.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,784 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.41 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.1 MB in the beginning and 158.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.35 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,786 INFO L168 Benchmark]: Boogie Preprocessor took 65.75 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,787 INFO L168 Benchmark]: RCFGBuilder took 1898.73 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 152.5 MB in the beginning and 189.3 MB in the end (delta: -36.8 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,788 INFO L168 Benchmark]: TraceAbstraction took 13623.38 ms. Allocated memory was 246.4 MB in the beginning and 376.4 MB in the end (delta: 130.0 MB). Free memory was 187.6 MB in the beginning and 149.4 MB in the end (delta: 38.2 MB). Peak memory consumption was 168.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:06,792 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 700.41 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.1 MB in the beginning and 158.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.35 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.75 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1898.73 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 152.5 MB in the beginning and 189.3 MB in the end (delta: -36.8 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13623.38 ms. Allocated memory was 246.4 MB in the beginning and 376.4 MB in the end (delta: 130.0 MB). Free memory was 187.6 MB in the beginning and 149.4 MB in the end (delta: 38.2 MB). Peak memory consumption was 168.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 801 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 4174 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1492; [L803] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1493; [L805] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t1494; [L807] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L745] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 351 SDtfs, 451 SDslu, 469 SDs, 0 SdLazy, 296 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 21649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...