/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/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:46:39,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:46:39,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:46:39,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:46:39,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:46:39,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:46:39,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:46:39,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:46:39,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:46:39,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:46:39,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:46:39,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:46:39,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:46:39,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:46:39,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:46:39,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:46:39,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:46:39,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:46:39,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:46:39,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:46:39,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:46:39,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:46:39,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:46:39,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:46:39,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:46:39,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:46:39,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:46:39,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:46:39,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:46:39,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:46:39,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:46:39,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:46:39,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:46:39,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:46:39,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:46:39,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:46:39,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:46:39,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:46:39,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:46:39,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:46:39,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:46:39,239 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:46:39,280 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:46:39,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:46:39,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:46:39,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:46:39,283 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:46:39,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:46:39,284 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:46:39,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:46:39,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:46:39,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:46:39,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:46:39,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:46:39,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:46:39,286 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:46:39,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:46:39,287 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:46:39,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:46:39,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:46:39,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:46:39,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:46:39,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:46:39,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:46:39,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:46:39,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:46:39,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:46:39,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:46:39,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:46:39,289 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:46:39,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:46:39,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:46:39,290 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:46:39,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:46:39,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:46:39,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:46:39,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:46:39,604 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:46:39,605 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-16 13:46:39,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f39da09d3/fe53305c6a9542a9b77a49bed3e6753f/FLAG60c9012dd [2020-10-16 13:46:40,226 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:46:40,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-16 13:46:40,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f39da09d3/fe53305c6a9542a9b77a49bed3e6753f/FLAG60c9012dd [2020-10-16 13:46:40,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f39da09d3/fe53305c6a9542a9b77a49bed3e6753f [2020-10-16 13:46:40,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:46:40,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:46:40,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:40,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:46:40,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:46:40,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:40" (1/1) ... [2020-10-16 13:46:40,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e823bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:40, skipping insertion in model container [2020-10-16 13:46:40,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:40" (1/1) ... [2020-10-16 13:46:40,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:46:40,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:46:41,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:41,097 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:46:41,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:41,230 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:46:41,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41 WrapperNode [2020-10-16 13:46:41,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:41,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:41,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:46:41,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:46:41,241 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:46:41" (1/1) ... [2020-10-16 13:46:41,261 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:46:41" (1/1) ... [2020-10-16 13:46:41,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:41,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:46:41,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:46:41,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:46:41,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (1/1) ... [2020-10-16 13:46:41,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:46:41,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:46:41,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:46:41,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:46:41,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (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:46:41,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:46:41,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:46:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:46:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:46:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:46:41,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:46:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:46:41,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:46:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:46:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:46:41,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:46:41,422 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:46:43,392 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:46:43,392 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:46:43,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:43 BoogieIcfgContainer [2020-10-16 13:46:43,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:46:43,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:46:43,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:46:43,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:46:43,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:40" (1/3) ... [2020-10-16 13:46:43,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcf5d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:43, skipping insertion in model container [2020-10-16 13:46:43,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:41" (2/3) ... [2020-10-16 13:46:43,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcf5d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:43, skipping insertion in model container [2020-10-16 13:46:43,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:43" (3/3) ... [2020-10-16 13:46:43,403 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2020-10-16 13:46:43,415 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:46:43,415 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:46:43,423 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:46:43,424 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:46:43,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,451 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,452 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:43,472 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:46:43,486 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 13:46:43,507 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:46:43,507 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:46:43,507 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:46:43,507 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:46:43,508 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:46:43,508 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:46:43,508 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:46:43,508 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:46:43,521 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:46:43,522 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-16 13:46:43,525 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-16 13:46:43,526 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 13:46:43,566 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 13:46:43,566 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:46:43,572 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 13:46:43,574 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-16 13:46:44,137 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:46:44,453 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-16 13:46:45,547 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 13:46:45,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:46:45,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:46:45,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 13:46:45,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:46:46,293 WARN L193 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 13:46:47,257 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2020-10-16 13:46:47,544 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-16 13:46:48,308 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 13:46:48,581 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 13:46:49,280 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:46:49,572 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:46:50,008 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 13:46:50,112 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-16 13:46:50,119 INFO L132 LiptonReduction]: Checked pairs total: 2263 [2020-10-16 13:46:50,120 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-16 13:46:50,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-16 13:46:50,145 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-16 13:46:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-16 13:46:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 13:46:50,154 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:50,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 13:46:50,155 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:46:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash 859717262, now seen corresponding path program 1 times [2020-10-16 13:46:50,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:50,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090937795] [2020-10-16 13:46:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:46:50,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090937795] [2020-10-16 13:46:50,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:50,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:46:50,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938767668] [2020-10-16 13:46:50,393 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:50,395 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:50,413 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-16 13:46:50,413 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:50,418 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:50,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:46:50,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:46:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:46:50,436 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-16 13:46:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:50,507 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-16 13:46:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:50,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 13:46:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:50,525 INFO L225 Difference]: With dead ends: 137 [2020-10-16 13:46:50,526 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 13:46:50,527 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:46:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 13:46:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-16 13:46:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-16 13:46:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-16 13:46:50,577 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-16 13:46:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:50,577 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-16 13:46:50,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:46:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-16 13:46:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:46:50,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:50,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:50,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:46:50,579 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:46:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1554625103, now seen corresponding path program 1 times [2020-10-16 13:46:50,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:50,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381743832] [2020-10-16 13:46:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:50,792 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:46:50,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381743832] [2020-10-16 13:46:50,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:50,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:46:50,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1044749066] [2020-10-16 13:46:50,794 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:50,795 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:50,801 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:46:50,801 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:50,801 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:50,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:46:50,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:46:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:46:50,805 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-16 13:46:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:50,848 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-16 13:46:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:50,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:46:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:50,851 INFO L225 Difference]: With dead ends: 111 [2020-10-16 13:46:50,851 INFO L226 Difference]: Without dead ends: 111 [2020-10-16 13:46:50,852 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:46:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-16 13:46:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-16 13:46:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-16 13:46:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-16 13:46:50,872 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-16 13:46:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:50,873 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-16 13:46:50,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:46:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-16 13:46:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:46:50,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:50,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:50,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:46:50,875 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:46:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 948719512, now seen corresponding path program 1 times [2020-10-16 13:46:50,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:50,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299420104] [2020-10-16 13:46:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:51,050 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:46:51,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299420104] [2020-10-16 13:46:51,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:51,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:51,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061319387] [2020-10-16 13:46:51,052 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:51,053 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:51,055 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 10 transitions. [2020-10-16 13:46:51,056 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:51,070 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:51,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:51,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:51,071 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 5 states. [2020-10-16 13:46:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:51,126 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-16 13:46:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:51,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-16 13:46:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:51,129 INFO L225 Difference]: With dead ends: 110 [2020-10-16 13:46:51,129 INFO L226 Difference]: Without dead ends: 110 [2020-10-16 13:46:51,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-16 13:46:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-16 13:46:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-16 13:46:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-16 13:46:51,140 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 8 [2020-10-16 13:46:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:51,140 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-16 13:46:51,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-16 13:46:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:46:51,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:51,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:51,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:46:51,142 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:46:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 948737399, now seen corresponding path program 1 times [2020-10-16 13:46:51,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:51,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886549401] [2020-10-16 13:46:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:46:51,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886549401] [2020-10-16 13:46:51,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:51,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:46:51,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248526721] [2020-10-16 13:46:51,246 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:51,247 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:51,249 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 16 transitions. [2020-10-16 13:46:51,249 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:51,264 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:46:51,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,266 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:46:51,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:51,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,304 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:51,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,319 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:51,352 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:51,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:46:51,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:46:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:51,353 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-16 13:46:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:51,386 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-16 13:46:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:51,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-16 13:46:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:51,388 INFO L225 Difference]: With dead ends: 109 [2020-10-16 13:46:51,388 INFO L226 Difference]: Without dead ends: 109 [2020-10-16 13:46:51,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-16 13:46:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-16 13:46:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-16 13:46:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-16 13:46:51,397 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-16 13:46:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:51,397 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-16 13:46:51,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:46:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-16 13:46:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:51,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:51,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:51,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:46:51,399 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:46:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -654518260, now seen corresponding path program 1 times [2020-10-16 13:46:51,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:51,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489813645] [2020-10-16 13:46:51,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:51,453 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:46:51,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489813645] [2020-10-16 13:46:51,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:51,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:51,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107429208] [2020-10-16 13:46:51,454 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:51,455 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:51,457 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 15 transitions. [2020-10-16 13:46:51,457 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:51,466 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:51,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:51,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:51,468 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-16 13:46:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:51,531 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-16 13:46:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:46:51,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 13:46:51,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:51,533 INFO L225 Difference]: With dead ends: 154 [2020-10-16 13:46:51,533 INFO L226 Difference]: Without dead ends: 118 [2020-10-16 13:46:51,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:46:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-16 13:46:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-16 13:46:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-16 13:46:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-16 13:46:51,541 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-16 13:46:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:51,541 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-16 13:46:51,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-16 13:46:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:51,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:51,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:51,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:46:51,543 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:46:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash -654466738, now seen corresponding path program 1 times [2020-10-16 13:46:51,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:51,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28957089] [2020-10-16 13:46:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:51,690 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:46:51,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28957089] [2020-10-16 13:46:51,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:51,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:51,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022019700] [2020-10-16 13:46:51,692 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:51,693 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:51,695 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-16 13:46:51,695 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:51,705 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:46:51,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:46:51,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:51,708 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:51,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,730 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:51,737 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:46:51,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:51,831 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2150#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~x~0 0) (<= ~x$w_buff0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)))] [2020-10-16 13:46:51,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:46:51,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:51,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:46:51,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:46:51,832 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 6 states. [2020-10-16 13:46:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:51,912 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-16 13:46:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:46:51,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-16 13:46:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:51,914 INFO L225 Difference]: With dead ends: 104 [2020-10-16 13:46:51,915 INFO L226 Difference]: Without dead ends: 104 [2020-10-16 13:46:51,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-16 13:46:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-16 13:46:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-16 13:46:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-16 13:46:51,921 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-16 13:46:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:51,921 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-16 13:46:51,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:46:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-16 13:46:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:51,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:51,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:51,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:46:51,923 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:46:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash -653912861, now seen corresponding path program 1 times [2020-10-16 13:46:51,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:51,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154228015] [2020-10-16 13:46:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:51,968 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:46:51,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154228015] [2020-10-16 13:46:51,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:51,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:46:51,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2039560463] [2020-10-16 13:46:51,969 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:51,970 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:51,972 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 17 transitions. [2020-10-16 13:46:51,972 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:51,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:52,013 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:52,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:46:52,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:46:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:52,014 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 4 states. [2020-10-16 13:46:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:52,050 INFO L93 Difference]: Finished difference Result 105 states and 222 transitions. [2020-10-16 13:46:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:46:52,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-16 13:46:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:52,055 INFO L225 Difference]: With dead ends: 105 [2020-10-16 13:46:52,055 INFO L226 Difference]: Without dead ends: 105 [2020-10-16 13:46:52,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-16 13:46:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-16 13:46:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-16 13:46:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 222 transitions. [2020-10-16 13:46:52,062 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 222 transitions. Word has length 9 [2020-10-16 13:46:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:52,062 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 222 transitions. [2020-10-16 13:46:52,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:46:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 222 transitions. [2020-10-16 13:46:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:52,063 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:52,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:52,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:46:52,064 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:46:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash -655211141, now seen corresponding path program 2 times [2020-10-16 13:46:52,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:52,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592230795] [2020-10-16 13:46:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:52,148 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:46:52,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592230795] [2020-10-16 13:46:52,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:52,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:52,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [827100838] [2020-10-16 13:46:52,149 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:52,150 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:52,152 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 21 transitions. [2020-10-16 13:46:52,153 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:52,170 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:52,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:52,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:52,171 INFO L87 Difference]: Start difference. First operand 105 states and 222 transitions. Second operand 5 states. [2020-10-16 13:46:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:52,210 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-16 13:46:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:46:52,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 13:46:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:52,212 INFO L225 Difference]: With dead ends: 102 [2020-10-16 13:46:52,212 INFO L226 Difference]: Without dead ends: 102 [2020-10-16 13:46:52,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-16 13:46:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-16 13:46:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-16 13:46:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-16 13:46:52,218 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-16 13:46:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:52,218 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-16 13:46:52,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-16 13:46:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:46:52,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:52,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:52,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:46:52,220 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:46:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1186366444, now seen corresponding path program 1 times [2020-10-16 13:46:52,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:52,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324636854] [2020-10-16 13:46:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:52,382 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:46:52,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324636854] [2020-10-16 13:46:52,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:52,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:46:52,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984208747] [2020-10-16 13:46:52,383 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:52,385 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:52,388 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-10-16 13:46:52,389 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:52,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:52,407 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:52,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:52,418 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:52,426 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:46:52,480 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3099#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~x$w_buff0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)))] [2020-10-16 13:46:52,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:46:52,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:46:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:52,482 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 7 states. [2020-10-16 13:46:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:52,613 INFO L93 Difference]: Finished difference Result 112 states and 233 transitions. [2020-10-16 13:46:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:46:52,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-10-16 13:46:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:52,615 INFO L225 Difference]: With dead ends: 112 [2020-10-16 13:46:52,615 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 13:46:52,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:46:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 13:46:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-10-16 13:46:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-16 13:46:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 220 transitions. [2020-10-16 13:46:52,620 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 220 transitions. Word has length 10 [2020-10-16 13:46:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:52,621 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 220 transitions. [2020-10-16 13:46:52,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:46:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 220 transitions. [2020-10-16 13:46:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:46:52,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:52,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:52,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:46:52,622 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:46:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1185068164, now seen corresponding path program 2 times [2020-10-16 13:46:52,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:52,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300180926] [2020-10-16 13:46:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:52,802 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:46:52,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300180926] [2020-10-16 13:46:52,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:52,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:46:52,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1150860235] [2020-10-16 13:46:52,803 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:52,804 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:52,807 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 34 transitions. [2020-10-16 13:46:52,807 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:52,913 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3436#(or (and (<= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= 0 ~x$w_buff0_used~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))), 3437#(or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-16 13:46:52,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:46:52,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:46:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:46:52,914 INFO L87 Difference]: Start difference. First operand 106 states and 220 transitions. Second operand 8 states. [2020-10-16 13:46:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:53,249 INFO L93 Difference]: Finished difference Result 118 states and 237 transitions. [2020-10-16 13:46:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:46:53,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-10-16 13:46:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:53,251 INFO L225 Difference]: With dead ends: 118 [2020-10-16 13:46:53,251 INFO L226 Difference]: Without dead ends: 102 [2020-10-16 13:46:53,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-16 13:46:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-16 13:46:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2020-10-16 13:46:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-16 13:46:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 195 transitions. [2020-10-16 13:46:53,255 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 195 transitions. Word has length 10 [2020-10-16 13:46:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:53,256 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 195 transitions. [2020-10-16 13:46:53,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:46:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 195 transitions. [2020-10-16 13:46:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:46:53,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:53,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:53,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:46:53,258 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:46:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1928407251, now seen corresponding path program 1 times [2020-10-16 13:46:53,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:53,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275214719] [2020-10-16 13:46:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:53,370 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:46:53,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275214719] [2020-10-16 13:46:53,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:53,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:53,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [147405081] [2020-10-16 13:46:53,371 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:53,373 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:53,380 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-16 13:46:53,380 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:53,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:53,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:53,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:53,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:53,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:53,446 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3760#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-16 13:46:53,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:53,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:53,447 INFO L87 Difference]: Start difference. First operand 95 states and 195 transitions. Second operand 5 states. [2020-10-16 13:46:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:53,487 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2020-10-16 13:46:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:46:53,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 13:46:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:53,488 INFO L225 Difference]: With dead ends: 61 [2020-10-16 13:46:53,488 INFO L226 Difference]: Without dead ends: 26 [2020-10-16 13:46:53,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-16 13:46:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-10-16 13:46:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-16 13:46:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-16 13:46:53,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2020-10-16 13:46:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:53,491 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-16 13:46:53,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-16 13:46:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:46:53,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:53,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:53,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:46:53,492 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:46:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:53,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1438791809, now seen corresponding path program 1 times [2020-10-16 13:46:53,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:53,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103458520] [2020-10-16 13:46:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:53,948 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:46:53,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103458520] [2020-10-16 13:46:53,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:53,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:46:53,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1243237762] [2020-10-16 13:46:53,949 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:53,952 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:53,958 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2020-10-16 13:46:53,958 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:53,970 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-10-16 13:46:53,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-16 13:46:53,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,973 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:53,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:53,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:53,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,010 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:54,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,037 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:54,039 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:46:54,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:54,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,062 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:46:54,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:54,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,083 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:54,095 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:54,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-16 13:46:54,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:54,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:54,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,144 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:54,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:54,167 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:46:54,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:54,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,176 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:54,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:54,190 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:54,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:54,205 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:54,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:54,230 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:54,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-16 13:46:54,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:46:54,367 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3882#(and (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= ~x$w_buff0_used~0 0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0)) (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256))))] [2020-10-16 13:46:54,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 13:46:54,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 13:46:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:46:54,369 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 9 states. [2020-10-16 13:46:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:54,543 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-10-16 13:46:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:46:54,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-16 13:46:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:54,544 INFO L225 Difference]: With dead ends: 32 [2020-10-16 13:46:54,544 INFO L226 Difference]: Without dead ends: 20 [2020-10-16 13:46:54,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-16 13:46:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-16 13:46:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-16 13:46:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-16 13:46:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-16 13:46:54,546 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-10-16 13:46:54,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:54,546 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-16 13:46:54,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 13:46:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-16 13:46:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:46:54,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:54,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:54,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:46:54,548 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1509183925, now seen corresponding path program 2 times [2020-10-16 13:46:54,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:54,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618565211] [2020-10-16 13:46:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:46:54,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:46:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:46:54,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:46:54,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:46:54,698 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:46:54,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:46:54,700 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:46:54,714 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In1546330 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In1546330 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In1546330 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1546330 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff1_used~0_Out1546330 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_Out1546330 ~x$w_buff1_used~0_In1546330))) (or (and (= ~x$w_buff0_used~0_Out1546330 ~x$w_buff0_used~0_In1546330) .cse3) (and .cse4 (= ~x$w_buff0_used~0_Out1546330 0) .cse5)) (= ~x$r_buff0_thd0~0_In1546330 ~x$r_buff0_thd0~0_Out1546330) (or (and (or (and .cse2 (= ~x~0_In1546330 ~x~0_Out1546330)) (and (= ~x~0_Out1546330 ~x$w_buff1~0_In1546330) .cse0 .cse1)) .cse3) (and .cse4 (= ~x~0_Out1546330 ~x$w_buff0~0_In1546330) .cse5)) (= ~x$r_buff1_thd0~0_In1546330 ~x$r_buff1_thd0~0_Out1546330) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1546330 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1546330, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1546330, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1546330, ~x$w_buff1~0=~x$w_buff1~0_In1546330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1546330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1546330, ~x~0=~x~0_In1546330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1546330} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1546330, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1546330, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1546330|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1546330|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1546330|, ~x$w_buff1~0=~x$w_buff1~0_In1546330, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1546330, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out1546330|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1546330, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1546330|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1546330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1546330, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1546330, ~x~0=~x~0_Out1546330} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 13:46:54,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:46:54,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:46:54,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:46:54,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:46:54,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:46:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,728 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:46:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,728 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:46:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,730 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:46:54,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,730 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:46:54,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,730 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:46:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,731 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:46:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,731 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:46:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,732 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:46:54,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,736 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:46:54,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,737 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:46:54,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,738 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:46:54,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,739 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:46:54,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,739 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:46:54,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,739 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:46:54,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,740 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:46:54,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,746 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:46:54,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,746 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:46:54,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,747 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:46:54,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:54,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:46:54 BasicIcfg [2020-10-16 13:46:54,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:46:54,799 INFO L168 Benchmark]: Toolchain (without parser) took 14285.99 ms. Allocated memory was 147.3 MB in the beginning and 356.5 MB in the end (delta: 209.2 MB). Free memory was 100.8 MB in the beginning and 215.1 MB in the end (delta: -114.3 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:54,800 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 147.3 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:46:54,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.10 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 160.5 MB in the end (delta: -60.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:54,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 205.0 MB. Free memory was 160.5 MB in the beginning and 157.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:54,802 INFO L168 Benchmark]: Boogie Preprocessor took 49.35 ms. Allocated memory is still 205.0 MB. Free memory was 157.2 MB in the beginning and 155.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:54,803 INFO L168 Benchmark]: RCFGBuilder took 2045.81 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 155.2 MB in the beginning and 197.6 MB in the end (delta: -42.4 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:54,804 INFO L168 Benchmark]: TraceAbstraction took 11401.50 ms. Allocated memory was 247.5 MB in the beginning and 356.5 MB in the end (delta: 109.1 MB). Free memory was 197.6 MB in the beginning and 215.1 MB in the end (delta: -17.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:54,808 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.17 ms. Allocated memory is still 147.3 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.10 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 160.5 MB in the end (delta: -60.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 205.0 MB. Free memory was 160.5 MB in the beginning and 157.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.35 ms. Allocated memory is still 205.0 MB. Free memory was 157.2 MB in the beginning and 155.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2045.81 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 155.2 MB in the beginning and 197.6 MB in the end (delta: -42.4 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11401.50 ms. Allocated memory was 247.5 MB in the beginning and 356.5 MB in the end (delta: 109.1 MB). Free memory was 197.6 MB in the beginning and 215.1 MB in the end (delta: -17.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 463 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 32 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.5s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 19 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 65 TotalNumberOfCompositions, 2263 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; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2483; [L780] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L781] 0 pthread_t t2484; [L782] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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] [L754] 2 y = 1 VAL [__unbuffered_cnt=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] [L723] 1 y = 2 VAL [__unbuffered_cnt=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=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=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=2] [L757] 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) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] 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) [L757] 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) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 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 [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 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 [L729] 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) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] 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) [L729] 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) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 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 [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 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 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] 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) [L799] 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) [L800] 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)) [L800] 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)) [L801] 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)) [L801] 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) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] 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) [L801] 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)) [L801] 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)) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 168 SDtfs, 154 SDslu, 233 SDs, 0 SdLazy, 262 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 14047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...