/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:21:51,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:21:51,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:21:51,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:21:51,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:21:51,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:21:51,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:21:51,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:21:51,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:21:51,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:21:51,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:21:51,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:21:51,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:21:51,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:21:51,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:21:51,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:21:51,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:21:51,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:21:51,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:21:51,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:21:51,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:21:51,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:21:51,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:21:51,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:21:51,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:21:51,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:21:51,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:21:51,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:21:51,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:21:51,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:21:51,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:21:51,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:21:51,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:21:51,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:21:51,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:21:51,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:21:51,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:21:51,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:21:51,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:21:51,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:21:51,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:21:51,150 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-McrAutomaton-WP.epf [2020-10-16 13:21:51,178 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:21:51,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:21:51,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:21:51,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:21:51,180 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:21:51,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:21:51,180 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:21:51,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:21:51,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:21:51,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:21:51,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:21:51,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:21:51,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:21:51,182 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:21:51,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:21:51,182 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:21:51,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:21:51,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:21:51,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:21:51,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:21:51,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:21:51,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:21:51,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:21:51,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:21:51,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:21:51,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:21:51,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:21:51,184 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:21:51,185 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:21:51,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:21:51,185 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:21:51,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:21:51,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:21:51,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:21:51,504 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:21:51,504 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:21:51,506 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2020-10-16 13:21:51,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc4abbca5/1f400b01f65846f88996c0c85317ee0a/FLAGd7e98a99c [2020-10-16 13:21:52,154 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:21:52,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2020-10-16 13:21:52,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc4abbca5/1f400b01f65846f88996c0c85317ee0a/FLAGd7e98a99c [2020-10-16 13:21:52,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc4abbca5/1f400b01f65846f88996c0c85317ee0a [2020-10-16 13:21:52,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:21:52,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:21:52,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:21:52,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:21:52,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:21:52,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:52,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd85e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52, skipping insertion in model container [2020-10-16 13:21:52,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:52,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:21:52,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:21:53,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:21:53,059 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:21:53,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:21:53,203 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:21:53,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53 WrapperNode [2020-10-16 13:21:53,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:21:53,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:21:53,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:21:53,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:21:53,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:21:53,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:21:53,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:21:53,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:21:53,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (1/1) ... [2020-10-16 13:21:53,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:21:53,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:21:53,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:21:53,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:21:53,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (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 13:21:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:21:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:21:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:21:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:21:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:21:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:21:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:21:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:21:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:21:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:21:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:21:53,391 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 13:21:55,401 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:21:55,401 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:21:55,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:55 BoogieIcfgContainer [2020-10-16 13:21:55,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:21:55,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:21:55,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:21:55,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:21:55,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:21:52" (1/3) ... [2020-10-16 13:21:55,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2e0bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:55, skipping insertion in model container [2020-10-16 13:21:55,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:53" (2/3) ... [2020-10-16 13:21:55,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2e0bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:55, skipping insertion in model container [2020-10-16 13:21:55,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:55" (3/3) ... [2020-10-16 13:21:55,414 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2020-10-16 13:21:55,427 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:21:55,427 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:21:55,435 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:21:55,436 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:21:55,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,484 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,485 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,498 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:21:55,517 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 13:21:55,545 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:21:55,545 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:21:55,545 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:21:55,545 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:21:55,545 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:21:55,546 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:21:55,546 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:21:55,546 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:21:55,563 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:21:55,564 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-16 13:21:55,568 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-16 13:21:55,571 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 13:21:55,620 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 13:21:55,620 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:21:55,626 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 13:21:55,628 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-16 13:21:57,479 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 13:21:57,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:21:57,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:21:57,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 13:21:57,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:21:58,326 WARN L193 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 13:21:58,998 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 13:21:59,858 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-16 13:21:59,955 INFO L132 LiptonReduction]: Checked pairs total: 2462 [2020-10-16 13:21:59,955 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-16 13:21:59,963 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-16 13:21:59,987 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2020-10-16 13:21:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2020-10-16 13:21:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 13:21:59,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:59,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 13:21:59,998 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 861621042, now seen corresponding path program 1 times [2020-10-16 13:22:00,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:00,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517635515] [2020-10-16 13:22:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,288 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 13:22:00,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517635515] [2020-10-16 13:22:00,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:00,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859638753] [2020-10-16 13:22:00,292 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,295 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,309 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-16 13:22:00,310 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,314 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:00,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:00,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:00,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:00,334 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2020-10-16 13:22:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:00,393 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-16 13:22:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:00,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 13:22:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:00,409 INFO L225 Difference]: With dead ends: 187 [2020-10-16 13:22:00,409 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 13:22:00,410 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 13:22:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 13:22:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-16 13:22:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-16 13:22:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-16 13:22:00,466 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2020-10-16 13:22:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:00,467 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-16 13:22:00,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-16 13:22:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:22:00,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:00,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:00,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:22:00,469 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1829495527, now seen corresponding path program 1 times [2020-10-16 13:22:00,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:00,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272455572] [2020-10-16 13:22:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,658 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 13:22:00,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272455572] [2020-10-16 13:22:00,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:00,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959155042] [2020-10-16 13:22:00,660 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,661 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,663 INFO L258 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-16 13:22:00,663 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,663 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:00,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:00,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:00,666 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 5 states. [2020-10-16 13:22:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:00,752 INFO L93 Difference]: Finished difference Result 158 states and 350 transitions. [2020-10-16 13:22:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:00,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-16 13:22:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:00,755 INFO L225 Difference]: With dead ends: 158 [2020-10-16 13:22:00,755 INFO L226 Difference]: Without dead ends: 133 [2020-10-16 13:22:00,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-16 13:22:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-10-16 13:22:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-16 13:22:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 308 transitions. [2020-10-16 13:22:00,769 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 308 transitions. Word has length 8 [2020-10-16 13:22:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:00,769 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 308 transitions. [2020-10-16 13:22:00,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 308 transitions. [2020-10-16 13:22:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:22:00,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:00,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:00,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:22:00,771 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:00,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 879762521, now seen corresponding path program 1 times [2020-10-16 13:22:00,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:00,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913990901] [2020-10-16 13:22:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,899 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 13:22:00,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913990901] [2020-10-16 13:22:00,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:00,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871551875] [2020-10-16 13:22:00,901 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,902 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,904 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:22:00,904 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,905 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:00,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:00,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:00,906 INFO L87 Difference]: Start difference. First operand 133 states and 308 transitions. Second operand 6 states. [2020-10-16 13:22:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,021 INFO L93 Difference]: Finished difference Result 145 states and 319 transitions. [2020-10-16 13:22:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:01,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-16 13:22:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,024 INFO L225 Difference]: With dead ends: 145 [2020-10-16 13:22:01,024 INFO L226 Difference]: Without dead ends: 125 [2020-10-16 13:22:01,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-16 13:22:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-16 13:22:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-16 13:22:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 284 transitions. [2020-10-16 13:22:01,035 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 284 transitions. Word has length 9 [2020-10-16 13:22:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,035 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 284 transitions. [2020-10-16 13:22:01,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 284 transitions. [2020-10-16 13:22:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:22:01,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:22:01,038 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1831308448, now seen corresponding path program 1 times [2020-10-16 13:22:01,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582091768] [2020-10-16 13:22:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,151 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 13:22:01,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582091768] [2020-10-16 13:22:01,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:01,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970702387] [2020-10-16 13:22:01,152 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,154 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,156 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-16 13:22:01,156 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,188 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:01,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:01,189 INFO L87 Difference]: Start difference. First operand 125 states and 284 transitions. Second operand 6 states. [2020-10-16 13:22:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,295 INFO L93 Difference]: Finished difference Result 135 states and 296 transitions. [2020-10-16 13:22:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:01,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-16 13:22:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,300 INFO L225 Difference]: With dead ends: 135 [2020-10-16 13:22:01,300 INFO L226 Difference]: Without dead ends: 120 [2020-10-16 13:22:01,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-16 13:22:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-16 13:22:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-16 13:22:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 268 transitions. [2020-10-16 13:22:01,310 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 268 transitions. Word has length 10 [2020-10-16 13:22:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,310 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 268 transitions. [2020-10-16 13:22:01,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 268 transitions. [2020-10-16 13:22:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:01,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:22:01,312 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash 935963072, now seen corresponding path program 1 times [2020-10-16 13:22:01,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697938424] [2020-10-16 13:22:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,438 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 13:22:01,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697938424] [2020-10-16 13:22:01,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:01,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830892624] [2020-10-16 13:22:01,440 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,441 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,444 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-16 13:22:01,444 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,462 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:01,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:01,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:01,463 INFO L87 Difference]: Start difference. First operand 119 states and 268 transitions. Second operand 7 states. [2020-10-16 13:22:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,654 INFO L93 Difference]: Finished difference Result 143 states and 311 transitions. [2020-10-16 13:22:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:22:01,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-16 13:22:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,661 INFO L225 Difference]: With dead ends: 143 [2020-10-16 13:22:01,661 INFO L226 Difference]: Without dead ends: 127 [2020-10-16 13:22:01,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-16 13:22:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-16 13:22:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-16 13:22:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 282 transitions. [2020-10-16 13:22:01,669 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 282 transitions. Word has length 11 [2020-10-16 13:22:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,670 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 282 transitions. [2020-10-16 13:22:01,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 282 transitions. [2020-10-16 13:22:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:01,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:22:01,672 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash -657848166, now seen corresponding path program 1 times [2020-10-16 13:22:01,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452152554] [2020-10-16 13:22:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,809 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 13:22:01,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452152554] [2020-10-16 13:22:01,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:01,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522436139] [2020-10-16 13:22:01,811 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,813 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,815 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-16 13:22:01,815 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,815 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:01,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:01,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:01,816 INFO L87 Difference]: Start difference. First operand 127 states and 282 transitions. Second operand 4 states. [2020-10-16 13:22:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,835 INFO L93 Difference]: Finished difference Result 108 states and 202 transitions. [2020-10-16 13:22:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:01,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:22:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,837 INFO L225 Difference]: With dead ends: 108 [2020-10-16 13:22:01,837 INFO L226 Difference]: Without dead ends: 79 [2020-10-16 13:22:01,837 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 13:22:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-16 13:22:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-16 13:22:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-16 13:22:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2020-10-16 13:22:01,842 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 11 [2020-10-16 13:22:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,842 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 138 transitions. [2020-10-16 13:22:01,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 138 transitions. [2020-10-16 13:22:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:22:01,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:22:01,844 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1314571888, now seen corresponding path program 1 times [2020-10-16 13:22:01,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255232785] [2020-10-16 13:22:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,912 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 13:22:01,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255232785] [2020-10-16 13:22:01,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:01,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851764170] [2020-10-16 13:22:01,913 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,915 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,917 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-16 13:22:01,917 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,918 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:01,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:01,919 INFO L87 Difference]: Start difference. First operand 79 states and 138 transitions. Second operand 5 states. [2020-10-16 13:22:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,956 INFO L93 Difference]: Finished difference Result 56 states and 90 transitions. [2020-10-16 13:22:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:01,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 13:22:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,958 INFO L225 Difference]: With dead ends: 56 [2020-10-16 13:22:01,958 INFO L226 Difference]: Without dead ends: 45 [2020-10-16 13:22:01,958 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 13:22:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-16 13:22:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-10-16 13:22:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-16 13:22:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-16 13:22:01,960 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2020-10-16 13:22:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,961 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-16 13:22:01,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-16 13:22:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:01,962 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:22:01,962 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash -299715963, now seen corresponding path program 1 times [2020-10-16 13:22:01,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015237917] [2020-10-16 13:22:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:02,090 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 13:22:02,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015237917] [2020-10-16 13:22:02,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:02,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:02,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674553718] [2020-10-16 13:22:02,092 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:02,095 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:02,101 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 38 transitions. [2020-10-16 13:22:02,101 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:02,165 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:02,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:02,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:02,166 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 7 states. [2020-10-16 13:22:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:02,235 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-10-16 13:22:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:22:02,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 13:22:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:02,236 INFO L225 Difference]: With dead ends: 60 [2020-10-16 13:22:02,236 INFO L226 Difference]: Without dead ends: 29 [2020-10-16 13:22:02,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-16 13:22:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-16 13:22:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-16 13:22:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-16 13:22:02,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-10-16 13:22:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:02,245 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-16 13:22:02,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-16 13:22:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:02,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:02,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:02,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:22:02,246 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1056418205, now seen corresponding path program 2 times [2020-10-16 13:22:02,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:02,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100527930] [2020-10-16 13:22:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:02,409 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 13:22:02,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100527930] [2020-10-16 13:22:02,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:02,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:22:02,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097135878] [2020-10-16 13:22:02,411 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:02,414 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:02,419 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 26 transitions. [2020-10-16 13:22:02,419 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:02,449 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:02,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,456 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:02,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:02,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,493 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:02,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,533 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:02,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,587 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:02,597 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-16 13:22:02,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:02,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:02,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:02,681 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:02,710 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3173#(or (= ~y~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-16 13:22:02,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:22:02,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:22:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:02,711 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 8 states. [2020-10-16 13:22:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:02,844 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-16 13:22:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 13:22:02,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 13:22:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:02,845 INFO L225 Difference]: With dead ends: 44 [2020-10-16 13:22:02,846 INFO L226 Difference]: Without dead ends: 29 [2020-10-16 13:22:02,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-16 13:22:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-16 13:22:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-16 13:22:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-16 13:22:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-10-16 13:22:02,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2020-10-16 13:22:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:02,850 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-10-16 13:22:02,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:22:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-10-16 13:22:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:02,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:02,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:02,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:22:02,851 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 563187007, now seen corresponding path program 3 times [2020-10-16 13:22:02,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:02,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296654734] [2020-10-16 13:22:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:02,975 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 13:22:02,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296654734] [2020-10-16 13:22:02,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:02,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:02,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737749410] [2020-10-16 13:22:02,977 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:02,979 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:02,985 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-10-16 13:22:02,985 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:03,045 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3289#(and (= ~y~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-10-16 13:22:03,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:22:03,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:03,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:22:03,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:03,047 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 8 states. [2020-10-16 13:22:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:03,133 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2020-10-16 13:22:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:03,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 13:22:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:03,135 INFO L225 Difference]: With dead ends: 38 [2020-10-16 13:22:03,135 INFO L226 Difference]: Without dead ends: 25 [2020-10-16 13:22:03,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-16 13:22:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-16 13:22:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-16 13:22:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-16 13:22:03,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-16 13:22:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:03,139 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-16 13:22:03,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:22:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-16 13:22:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:03,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:03,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:03,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:22:03,140 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -869615873, now seen corresponding path program 4 times [2020-10-16 13:22:03,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:03,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373754986] [2020-10-16 13:22:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:03,426 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 13:22:03,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373754986] [2020-10-16 13:22:03,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:03,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 13:22:03,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321119233] [2020-10-16 13:22:03,427 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:03,429 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:03,435 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-10-16 13:22:03,436 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:03,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-16 13:22:03,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:22:03,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:03,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:03,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,457 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:03,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,526 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:03,535 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:03,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-16 13:22:03,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,605 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:03,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 13:22:03,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 13:22:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:03,606 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 9 states. [2020-10-16 13:22:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:03,872 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-16 13:22:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 13:22:03,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 13:22:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:03,873 INFO L225 Difference]: With dead ends: 34 [2020-10-16 13:22:03,873 INFO L226 Difference]: Without dead ends: 21 [2020-10-16 13:22:03,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-16 13:22:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-16 13:22:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-16 13:22:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-16 13:22:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-16 13:22:03,875 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-16 13:22:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:03,876 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-16 13:22:03,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 13:22:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-16 13:22:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:03,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:03,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:03,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:22:03,879 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1239204549, now seen corresponding path program 5 times [2020-10-16 13:22:03,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:03,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146516416] [2020-10-16 13:22:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:03,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:03,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:04,029 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:22:04,029 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:22:04,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:22:04,043 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 13:22:04,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,045 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 13:22:04,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,045 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 13:22:04,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,045 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 13:22:04,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,049 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,050 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,050 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:04,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:04,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:04 BasicIcfg [2020-10-16 13:22:04,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:22:04,103 INFO L168 Benchmark]: Toolchain (without parser) took 11653.77 ms. Allocated memory was 138.9 MB in the beginning and 334.5 MB in the end (delta: 195.6 MB). Free memory was 101.0 MB in the beginning and 175.1 MB in the end (delta: -74.1 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,104 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.56 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 157.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.07 ms. Allocated memory is still 201.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,106 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,107 INFO L168 Benchmark]: RCFGBuilder took 2083.09 ms. Allocated memory was 201.9 MB in the beginning and 250.6 MB in the end (delta: 48.8 MB). Free memory was 151.6 MB in the beginning and 207.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,108 INFO L168 Benchmark]: TraceAbstraction took 8696.41 ms. Allocated memory was 250.6 MB in the beginning and 334.5 MB in the end (delta: 83.9 MB). Free memory was 207.2 MB in the beginning and 175.1 MB in the end (delta: 32.1 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:04,113 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.56 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 157.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.07 ms. Allocated memory is still 201.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2083.09 ms. Allocated memory was 201.9 MB in the beginning and 250.6 MB in the end (delta: 48.8 MB). Free memory was 151.6 MB in the beginning and 207.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8696.41 ms. Allocated memory was 250.6 MB in the beginning and 334.5 MB in the end (delta: 83.9 MB). Free memory was 207.2 MB in the beginning and 175.1 MB in the end (delta: 32.1 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 429 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 40 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 80 PlacesBefore, 28 PlacesAfterwards, 75 TransitionsBefore, 22 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 2462 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1453; [L782] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 0 pthread_t t1454; [L784] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L759] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L790] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L801] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L802] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L802] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L803] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L803] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L803] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L804] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L804] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L805] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L806] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L806] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L807] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L807] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 186 SDtfs, 239 SDslu, 391 SDs, 0 SdLazy, 283 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 11596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...