/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:35:50,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:35:50,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:35:50,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:35:50,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:35:50,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:35:50,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:35:50,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:35:50,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:35:50,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:35:50,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:35:50,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:35:50,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:35:50,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:35:50,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:35:50,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:35:50,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:35:50,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:35:50,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:35:50,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:35:50,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:35:50,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:35:50,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:35:50,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:35:50,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:35:50,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:35:50,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:35:50,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:35:50,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:35:50,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:35:50,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:35:50,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:35:50,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:35:50,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:35:50,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:35:50,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:35:50,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:35:50,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:35:50,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:35:50,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:35:50,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:35:50,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:35:50,580 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:35:50,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:35:50,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:35:50,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:35:50,584 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:35:50,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:35:50,585 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:35:50,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:35:50,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:35:50,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:35:50,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:35:50,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:35:50,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:35:50,586 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:35:50,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:35:50,587 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:35:50,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:35:50,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:35:50,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:35:50,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:35:50,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:35:50,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:35:50,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:35:50,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:35:50,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:35:50,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:35:50,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:35:50,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:35:50,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:35:50,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:35:50,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:35:50,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:35:50,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:35:50,863 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:35:50,863 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:35:50,864 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2020-10-15 18:35:50,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498c14918/6bf76c7556ef4f24b0ac6f328ea96262/FLAGbaa9560da [2020-10-15 18:35:51,422 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:35:51,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2020-10-15 18:35:51,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498c14918/6bf76c7556ef4f24b0ac6f328ea96262/FLAGbaa9560da [2020-10-15 18:35:51,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498c14918/6bf76c7556ef4f24b0ac6f328ea96262 [2020-10-15 18:35:51,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:35:51,731 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:35:51,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:35:51,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:35:51,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:35:51,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:35:51" (1/1) ... [2020-10-15 18:35:51,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a8f3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:51, skipping insertion in model container [2020-10-15 18:35:51,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:35:51" (1/1) ... [2020-10-15 18:35:51,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:35:51,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:35:52,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:35:52,252 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:35:52,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:35:52,391 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:35:52,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52 WrapperNode [2020-10-15 18:35:52,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:35:52,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:35:52,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:35:52,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:35:52,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:35:52,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:35:52,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:35:52,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:35:52,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... [2020-10-15 18:35:52,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:35:52,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:35:52,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:35:52,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:35:52,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:35:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:35:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:35:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:35:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:35:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:35:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:35:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:35:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:35:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:35:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:35:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:35:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:35:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:35:52,564 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:35:54,330 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:35:54,330 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:35:54,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:35:54 BoogieIcfgContainer [2020-10-15 18:35:54,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:35:54,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:35:54,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:35:54,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:35:54,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:35:51" (1/3) ... [2020-10-15 18:35:54,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b952b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:35:54, skipping insertion in model container [2020-10-15 18:35:54,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:52" (2/3) ... [2020-10-15 18:35:54,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b952b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:35:54, skipping insertion in model container [2020-10-15 18:35:54,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:35:54" (3/3) ... [2020-10-15 18:35:54,342 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_pso.opt.i [2020-10-15 18:35:54,355 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:35:54,355 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:35:54,363 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:35:54,364 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:35:54,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,402 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,403 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,409 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,410 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,421 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,421 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,423 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,423 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:54,440 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 18:35:54,460 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:35:54,460 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:35:54,460 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:35:54,461 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:35:54,461 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:35:54,461 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:35:54,461 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:35:54,461 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:35:54,474 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:35:54,477 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-15 18:35:54,479 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-15 18:35:54,481 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-15 18:35:54,528 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-15 18:35:54,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:35:54,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-15 18:35:54,537 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-15 18:35:54,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:54,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:54,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:54,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:54,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:54,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:54,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:54,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:54,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:54,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:54,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:54,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:54,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:55,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:55,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:55,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:55,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:55,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:55,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:35:55,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:55,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:55,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:55,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:55,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:55,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:55,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:55,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-15 18:35:55,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:55,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:35:55,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:56,926 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-15 18:35:56,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-15 18:35:56,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:56,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:35:56,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:57,679 WARN L193 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-15 18:35:57,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:57,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:57,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:57,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:57,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:57,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:57,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:57,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:57,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:57,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:57,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:57,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:57,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:57,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:57,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:57,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,149 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-15 18:35:58,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:35:58,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:35:58,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:58,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:58,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:58,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:35:58,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:59,695 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-15 18:35:59,804 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 18:35:59,811 INFO L132 LiptonReduction]: Checked pairs total: 4870 [2020-10-15 18:35:59,811 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-15 18:35:59,818 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-15 18:35:59,889 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-15 18:35:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-15 18:35:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 18:35:59,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:59,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 18:35:59,898 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:35:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1003458471, now seen corresponding path program 1 times [2020-10-15 18:35:59,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:59,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24092610] [2020-10-15 18:35:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:00,134 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-15 18:36:00,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24092610] [2020-10-15 18:36:00,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:00,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:36:00,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602187121] [2020-10-15 18:36:00,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:36:00,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:36:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:36:00,159 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-15 18:36:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:00,248 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-15 18:36:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:36:00,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 18:36:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:00,292 INFO L225 Difference]: With dead ends: 812 [2020-10-15 18:36:00,293 INFO L226 Difference]: Without dead ends: 687 [2020-10-15 18:36:00,294 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-15 18:36:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-15 18:36:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-15 18:36:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-15 18:36:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-15 18:36:00,399 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 5 [2020-10-15 18:36:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:00,399 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-15 18:36:00,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:36:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-15 18:36:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:36:00,401 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:00,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:00,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:36:00,402 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1198586280, now seen corresponding path program 1 times [2020-10-15 18:36:00,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:00,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565144077] [2020-10-15 18:36:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:00,582 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-15 18:36:00,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565144077] [2020-10-15 18:36:00,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:00,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:36:00,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602075898] [2020-10-15 18:36:00,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:36:00,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:36:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:00,586 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 5 states. [2020-10-15 18:36:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:00,718 INFO L93 Difference]: Finished difference Result 802 states and 2417 transitions. [2020-10-15 18:36:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:36:00,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-15 18:36:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:00,725 INFO L225 Difference]: With dead ends: 802 [2020-10-15 18:36:00,725 INFO L226 Difference]: Without dead ends: 677 [2020-10-15 18:36:00,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:36:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-15 18:36:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2020-10-15 18:36:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-15 18:36:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions. [2020-10-15 18:36:00,754 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10 [2020-10-15 18:36:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:00,755 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions. [2020-10-15 18:36:00,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:36:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions. [2020-10-15 18:36:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:36:00,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:00,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:00,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:36:00,758 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:00,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1848096047, now seen corresponding path program 1 times [2020-10-15 18:36:00,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:00,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147565617] [2020-10-15 18:36:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:00,888 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-15 18:36:00,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147565617] [2020-10-15 18:36:00,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:00,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:36:00,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421327937] [2020-10-15 18:36:00,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:36:00,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:00,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:36:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:36:00,893 INFO L87 Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states. [2020-10-15 18:36:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:00,922 INFO L93 Difference]: Finished difference Result 737 states and 2225 transitions. [2020-10-15 18:36:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:36:00,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:36:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:00,928 INFO L225 Difference]: With dead ends: 737 [2020-10-15 18:36:00,928 INFO L226 Difference]: Without dead ends: 637 [2020-10-15 18:36:00,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-10-15 18:36:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2020-10-15 18:36:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-10-15 18:36:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2020-10-15 18:36:00,950 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 11 [2020-10-15 18:36:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:00,950 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2020-10-15 18:36:00,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:36:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2020-10-15 18:36:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:36:00,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:00,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:00,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:36:00,953 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:00,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1542018617, now seen corresponding path program 1 times [2020-10-15 18:36:00,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:00,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52099133] [2020-10-15 18:36:00,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:36:01,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52099133] [2020-10-15 18:36:01,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:01,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:36:01,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813893355] [2020-10-15 18:36:01,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:36:01,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:36:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:01,036 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand 5 states. [2020-10-15 18:36:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:01,161 INFO L93 Difference]: Finished difference Result 697 states and 2083 transitions. [2020-10-15 18:36:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:36:01,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-15 18:36:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:01,167 INFO L225 Difference]: With dead ends: 697 [2020-10-15 18:36:01,167 INFO L226 Difference]: Without dead ends: 597 [2020-10-15 18:36:01,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:36:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-15 18:36:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2020-10-15 18:36:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-15 18:36:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1828 transitions. [2020-10-15 18:36:01,186 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1828 transitions. Word has length 11 [2020-10-15 18:36:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:01,187 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 1828 transitions. [2020-10-15 18:36:01,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:36:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1828 transitions. [2020-10-15 18:36:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:36:01,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:01,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:01,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:36:01,191 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1499890242, now seen corresponding path program 1 times [2020-10-15 18:36:01,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:01,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626758717] [2020-10-15 18:36:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:01,375 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-15 18:36:01,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626758717] [2020-10-15 18:36:01,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:01,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:36:01,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681566058] [2020-10-15 18:36:01,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:36:01,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:36:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:36:01,377 INFO L87 Difference]: Start difference. First operand 597 states and 1828 transitions. Second operand 7 states. [2020-10-15 18:36:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:01,605 INFO L93 Difference]: Finished difference Result 681 states and 2032 transitions. [2020-10-15 18:36:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:36:01,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-15 18:36:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:01,611 INFO L225 Difference]: With dead ends: 681 [2020-10-15 18:36:01,611 INFO L226 Difference]: Without dead ends: 601 [2020-10-15 18:36:01,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:36:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-10-15 18:36:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2020-10-15 18:36:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-10-15 18:36:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1840 transitions. [2020-10-15 18:36:01,636 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1840 transitions. Word has length 12 [2020-10-15 18:36:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:01,637 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 1840 transitions. [2020-10-15 18:36:01,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:36:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1840 transitions. [2020-10-15 18:36:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:36:01,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:01,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:01,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:36:01,639 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1872076824, now seen corresponding path program 1 times [2020-10-15 18:36:01,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:01,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778005989] [2020-10-15 18:36:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:01,735 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-15 18:36:01,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778005989] [2020-10-15 18:36:01,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:01,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:36:01,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633751971] [2020-10-15 18:36:01,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:36:01,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:36:01,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:01,738 INFO L87 Difference]: Start difference. First operand 601 states and 1840 transitions. Second operand 5 states. [2020-10-15 18:36:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:01,896 INFO L93 Difference]: Finished difference Result 691 states and 2062 transitions. [2020-10-15 18:36:01,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:36:01,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:36:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:01,901 INFO L225 Difference]: With dead ends: 691 [2020-10-15 18:36:01,902 INFO L226 Difference]: Without dead ends: 617 [2020-10-15 18:36:01,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:36:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-10-15 18:36:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 605. [2020-10-15 18:36:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2020-10-15 18:36:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1840 transitions. [2020-10-15 18:36:01,919 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1840 transitions. Word has length 13 [2020-10-15 18:36:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:01,919 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 1840 transitions. [2020-10-15 18:36:01,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:36:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1840 transitions. [2020-10-15 18:36:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:36:01,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:01,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:01,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:36:01,921 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash -312500600, now seen corresponding path program 1 times [2020-10-15 18:36:01,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:01,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182338062] [2020-10-15 18:36:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:01,987 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-15 18:36:01,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182338062] [2020-10-15 18:36:01,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:01,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:36:01,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126209290] [2020-10-15 18:36:01,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:36:01,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:01,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:36:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:01,989 INFO L87 Difference]: Start difference. First operand 605 states and 1840 transitions. Second operand 5 states. [2020-10-15 18:36:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:02,050 INFO L93 Difference]: Finished difference Result 825 states and 2481 transitions. [2020-10-15 18:36:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:36:02,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 18:36:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:02,054 INFO L225 Difference]: With dead ends: 825 [2020-10-15 18:36:02,054 INFO L226 Difference]: Without dead ends: 429 [2020-10-15 18:36:02,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:36:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-10-15 18:36:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2020-10-15 18:36:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-10-15 18:36:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1238 transitions. [2020-10-15 18:36:02,067 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1238 transitions. Word has length 14 [2020-10-15 18:36:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:02,067 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 1238 transitions. [2020-10-15 18:36:02,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:36:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1238 transitions. [2020-10-15 18:36:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:36:02,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:02,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:02,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:36:02,069 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1217851357, now seen corresponding path program 1 times [2020-10-15 18:36:02,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:02,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310786274] [2020-10-15 18:36:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:02,131 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-15 18:36:02,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310786274] [2020-10-15 18:36:02,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:02,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:36:02,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583706864] [2020-10-15 18:36:02,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:36:02,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:36:02,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:36:02,133 INFO L87 Difference]: Start difference. First operand 429 states and 1238 transitions. Second operand 4 states. [2020-10-15 18:36:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:02,162 INFO L93 Difference]: Finished difference Result 394 states and 1002 transitions. [2020-10-15 18:36:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:36:02,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 18:36:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:02,165 INFO L225 Difference]: With dead ends: 394 [2020-10-15 18:36:02,165 INFO L226 Difference]: Without dead ends: 309 [2020-10-15 18:36:02,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-10-15 18:36:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2020-10-15 18:36:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-10-15 18:36:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 774 transitions. [2020-10-15 18:36:02,174 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 774 transitions. Word has length 14 [2020-10-15 18:36:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:02,174 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 774 transitions. [2020-10-15 18:36:02,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:36:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 774 transitions. [2020-10-15 18:36:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:36:02,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:02,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:02,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:36:02,175 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:02,176 INFO L82 PathProgramCache]: Analyzing trace with hash 768362948, now seen corresponding path program 1 times [2020-10-15 18:36:02,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:02,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523789558] [2020-10-15 18:36:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:02,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-15 18:36:02,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523789558] [2020-10-15 18:36:02,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:02,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:36:02,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377392026] [2020-10-15 18:36:02,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:36:02,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:36:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:02,247 INFO L87 Difference]: Start difference. First operand 309 states and 774 transitions. Second operand 5 states. [2020-10-15 18:36:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:02,287 INFO L93 Difference]: Finished difference Result 234 states and 528 transitions. [2020-10-15 18:36:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:36:02,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:36:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:02,289 INFO L225 Difference]: With dead ends: 234 [2020-10-15 18:36:02,289 INFO L226 Difference]: Without dead ends: 189 [2020-10-15 18:36:02,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:36:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-15 18:36:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2020-10-15 18:36:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-15 18:36:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 418 transitions. [2020-10-15 18:36:02,295 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 418 transitions. Word has length 15 [2020-10-15 18:36:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:02,295 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 418 transitions. [2020-10-15 18:36:02,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:36:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 418 transitions. [2020-10-15 18:36:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:36:02,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:02,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:02,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:36:02,297 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:02,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash 522005825, now seen corresponding path program 1 times [2020-10-15 18:36:02,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:02,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775078292] [2020-10-15 18:36:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:02,371 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-15 18:36:02,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775078292] [2020-10-15 18:36:02,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:02,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:36:02,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068670702] [2020-10-15 18:36:02,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:36:02,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:36:02,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:36:02,374 INFO L87 Difference]: Start difference. First operand 189 states and 418 transitions. Second operand 6 states. [2020-10-15 18:36:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:02,418 INFO L93 Difference]: Finished difference Result 162 states and 362 transitions. [2020-10-15 18:36:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:36:02,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 18:36:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:02,420 INFO L225 Difference]: With dead ends: 162 [2020-10-15 18:36:02,420 INFO L226 Difference]: Without dead ends: 151 [2020-10-15 18:36:02,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:36:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-15 18:36:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2020-10-15 18:36:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-15 18:36:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 342 transitions. [2020-10-15 18:36:02,424 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 342 transitions. Word has length 18 [2020-10-15 18:36:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:02,425 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 342 transitions. [2020-10-15 18:36:02,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:36:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 342 transitions. [2020-10-15 18:36:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:36:02,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:02,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:02,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:36:02,426 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1257153572, now seen corresponding path program 1 times [2020-10-15 18:36:02,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:02,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751937164] [2020-10-15 18:36:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:02,488 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-15 18:36:02,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751937164] [2020-10-15 18:36:02,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:02,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:36:02,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745190269] [2020-10-15 18:36:02,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:36:02,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:02,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:36:02,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:36:02,490 INFO L87 Difference]: Start difference. First operand 151 states and 342 transitions. Second operand 5 states. [2020-10-15 18:36:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:02,521 INFO L93 Difference]: Finished difference Result 190 states and 420 transitions. [2020-10-15 18:36:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:36:02,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-10-15 18:36:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:02,522 INFO L225 Difference]: With dead ends: 190 [2020-10-15 18:36:02,522 INFO L226 Difference]: Without dead ends: 71 [2020-10-15 18:36:02,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:36:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-15 18:36:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-15 18:36:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-15 18:36:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2020-10-15 18:36:02,525 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 22 [2020-10-15 18:36:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:02,526 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2020-10-15 18:36:02,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:36:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2020-10-15 18:36:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:36:02,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:02,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:02,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:36:02,527 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1440025788, now seen corresponding path program 2 times [2020-10-15 18:36:02,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:02,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744034673] [2020-10-15 18:36:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:36:02,828 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-15 18:36:02,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744034673] [2020-10-15 18:36:02,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:36:02,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:36:02,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835948811] [2020-10-15 18:36:02,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:36:02,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:36:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:36:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:36:02,831 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand 10 states. [2020-10-15 18:36:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:36:03,127 INFO L93 Difference]: Finished difference Result 131 states and 233 transitions. [2020-10-15 18:36:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:36:03,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-15 18:36:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:36:03,129 INFO L225 Difference]: With dead ends: 131 [2020-10-15 18:36:03,129 INFO L226 Difference]: Without dead ends: 75 [2020-10-15 18:36:03,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:36:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-15 18:36:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-10-15 18:36:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-15 18:36:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2020-10-15 18:36:03,131 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 22 [2020-10-15 18:36:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:36:03,131 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2020-10-15 18:36:03,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:36:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2020-10-15 18:36:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:36:03,132 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:36:03,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:36:03,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:36:03,133 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:36:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:36:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash -37680388, now seen corresponding path program 3 times [2020-10-15 18:36:03,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:36:03,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806946308] [2020-10-15 18:36:03,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:36:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:36:03,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:36:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:36:03,209 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:36:03,241 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:36:03,242 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:36:03,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:36:03,263 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-15 18:36:03,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,265 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-15 18:36:03,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,265 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-15 18:36:03,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,266 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-15 18:36:03,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,266 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-15 18:36:03,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,266 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-15 18:36:03,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,267 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-15 18:36:03,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,267 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-15 18:36:03,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,268 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-15 18:36:03,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,268 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-15 18:36:03,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,268 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-15 18:36:03,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,269 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-15 18:36:03,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,269 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-15 18:36:03,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,270 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-15 18:36:03,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,270 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-15 18:36:03,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,270 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-15 18:36:03,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,270 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-15 18:36:03,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,271 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-15 18:36:03,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,272 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-15 18:36:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,272 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-15 18:36:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,272 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-15 18:36:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,273 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-15 18:36:03,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,273 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-15 18:36:03,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,273 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-15 18:36:03,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,274 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-15 18:36:03,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,274 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-15 18:36:03,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,275 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-15 18:36:03,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,275 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-15 18:36:03,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,275 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-15 18:36:03,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,276 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-15 18:36:03,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,276 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-15 18:36:03,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,276 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-15 18:36:03,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,276 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-15 18:36:03,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,277 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-15 18:36:03,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,277 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-15 18:36:03,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,278 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-15 18:36:03,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:36:03,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:36:03 BasicIcfg [2020-10-15 18:36:03,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:36:03,343 INFO L168 Benchmark]: Toolchain (without parser) took 11612.39 ms. Allocated memory was 252.7 MB in the beginning and 492.3 MB in the end (delta: 239.6 MB). Free memory was 208.5 MB in the beginning and 188.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 259.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:36:03,344 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:36:03,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.45 ms. Allocated memory was 252.7 MB in the beginning and 319.3 MB in the end (delta: 66.6 MB). Free memory was 208.5 MB in the beginning and 271.4 MB in the end (delta: -62.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:36:03,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.93 ms. Allocated memory is still 319.3 MB. Free memory was 271.4 MB in the beginning and 268.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:36:03,346 INFO L168 Benchmark]: Boogie Preprocessor took 38.69 ms. Allocated memory is still 319.3 MB. Free memory was 268.9 MB in the beginning and 266.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:36:03,347 INFO L168 Benchmark]: RCFGBuilder took 1836.74 ms. Allocated memory was 319.3 MB in the beginning and 359.1 MB in the end (delta: 39.8 MB). Free memory was 266.3 MB in the beginning and 192.5 MB in the end (delta: 73.9 MB). Peak memory consumption was 113.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:36:03,348 INFO L168 Benchmark]: TraceAbstraction took 9007.38 ms. Allocated memory was 359.1 MB in the beginning and 492.3 MB in the end (delta: 133.2 MB). Free memory was 189.2 MB in the beginning and 188.7 MB in the end (delta: 473.4 kB). Peak memory consumption was 133.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:36:03,351 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.20 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 660.45 ms. Allocated memory was 252.7 MB in the beginning and 319.3 MB in the end (delta: 66.6 MB). Free memory was 208.5 MB in the beginning and 271.4 MB in the end (delta: -62.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.93 ms. Allocated memory is still 319.3 MB. Free memory was 271.4 MB in the beginning and 268.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.69 ms. Allocated memory is still 319.3 MB. Free memory was 268.9 MB in the beginning and 266.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1836.74 ms. Allocated memory was 319.3 MB in the beginning and 359.1 MB in the end (delta: 39.8 MB). Free memory was 266.3 MB in the beginning and 192.5 MB in the end (delta: 73.9 MB). Peak memory consumption was 113.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9007.38 ms. Allocated memory was 359.1 MB in the beginning and 492.3 MB in the end (delta: 133.2 MB). Free memory was 189.2 MB in the beginning and 188.7 MB in the end (delta: 473.4 kB). Peak memory consumption was 133.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1065 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 128 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.3s, 101 PlacesBefore, 37 PlacesAfterwards, 93 TransitionsBefore, 28 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4870 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t2290; [L810] FCALL, FORK 0 pthread_create(&t2290, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L811] 0 pthread_t t2291; [L812] FCALL, FORK 0 pthread_create(&t2291, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L813] 0 pthread_t t2292; [L814] FCALL, FORK 0 pthread_create(&t2292, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L781] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L767] 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) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] 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) [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 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 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L787] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L738] 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) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] 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) [L738] 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) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 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 [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 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 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x [L831] 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) [L831] 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) [L832] 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)) [L832] EXPR 0 !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) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L832] EXPR 0 !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) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] 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)) [L835] 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)) [L836] 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)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L836] 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)) [L836] 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)) [L837] 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)) [L837] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] 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)) [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L839] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L839] 0 x = x$flush_delayed ? x$mem_tmp : x [L840] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 322 SDtfs, 389 SDslu, 718 SDs, 0 SdLazy, 372 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 17024 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...