/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/safe004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 12:53:32,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 12:53:32,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 12:53:32,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 12:53:32,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 12:53:32,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 12:53:32,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 12:53:32,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 12:53:32,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 12:53:32,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 12:53:32,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 12:53:32,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 12:53:32,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 12:53:32,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 12:53:32,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 12:53:32,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 12:53:32,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 12:53:32,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 12:53:32,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 12:53:32,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 12:53:32,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 12:53:32,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 12:53:32,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 12:53:32,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 12:53:32,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 12:53:32,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 12:53:32,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 12:53:32,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 12:53:32,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 12:53:32,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 12:53:32,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 12:53:32,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 12:53:32,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 12:53:32,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 12:53:32,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 12:53:32,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 12:53:32,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 12:53:32,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 12:53:32,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 12:53:32,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 12:53:32,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 12:53:32,481 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-09 12:53:32,522 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 12:53:32,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 12:53:32,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 12:53:32,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 12:53:32,525 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 12:53:32,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 12:53:32,526 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 12:53:32,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 12:53:32,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 12:53:32,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 12:53:32,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 12:53:32,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 12:53:32,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 12:53:32,529 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 12:53:32,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 12:53:32,529 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 12:53:32,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 12:53:32,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 12:53:32,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 12:53:32,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 12:53:32,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 12:53:32,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:53:32,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 12:53:32,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 12:53:32,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 12:53:32,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 12:53:32,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 12:53:32,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 12:53:32,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 12:53:32,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 12:53:32,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 12:53:32,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 12:53:32,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 12:53:32,844 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 12:53:32,845 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 12:53:32,846 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2020-10-09 12:53:32,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c8c1d2e/04d0c2f73e19469fb458fdd4b8b4bede/FLAG0f2b72c44 [2020-10-09 12:53:33,521 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 12:53:33,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2020-10-09 12:53:33,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c8c1d2e/04d0c2f73e19469fb458fdd4b8b4bede/FLAG0f2b72c44 [2020-10-09 12:53:33,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c8c1d2e/04d0c2f73e19469fb458fdd4b8b4bede [2020-10-09 12:53:33,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 12:53:33,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 12:53:33,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 12:53:33,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 12:53:33,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 12:53:33,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:53:33" (1/1) ... [2020-10-09 12:53:33,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff41f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:33, skipping insertion in model container [2020-10-09 12:53:33,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:53:33" (1/1) ... [2020-10-09 12:53:33,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 12:53:33,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 12:53:34,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:53:34,372 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 12:53:34,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:53:34,524 INFO L208 MainTranslator]: Completed translation [2020-10-09 12:53:34,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34 WrapperNode [2020-10-09 12:53:34,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 12:53:34,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 12:53:34,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 12:53:34,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 12:53:34,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 12:53:34,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 12:53:34,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 12:53:34,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 12:53:34,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (1/1) ... [2020-10-09 12:53:34,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 12:53:34,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 12:53:34,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 12:53:34,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 12:53:34,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (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-09 12:53:34,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 12:53:34,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 12:53:34,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 12:53:34,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 12:53:34,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 12:53:34,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 12:53:34,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 12:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 12:53:34,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 12:53:34,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 12:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 12:53:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 12:53:34,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 12:53:34,739 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 12:53:36,816 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 12:53:36,816 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 12:53:36,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:53:36 BoogieIcfgContainer [2020-10-09 12:53:36,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 12:53:36,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 12:53:36,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 12:53:36,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 12:53:36,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:53:33" (1/3) ... [2020-10-09 12:53:36,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ada890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:53:36, skipping insertion in model container [2020-10-09 12:53:36,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:34" (2/3) ... [2020-10-09 12:53:36,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ada890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:53:36, skipping insertion in model container [2020-10-09 12:53:36,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:53:36" (3/3) ... [2020-10-09 12:53:36,828 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i [2020-10-09 12:53:36,841 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 12:53:36,841 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 12:53:36,849 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 12:53:36,850 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 12:53:36,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,880 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,881 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,889 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,889 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,897 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,903 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,905 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:36,926 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 12:53:36,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 12:53:36,946 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 12:53:36,946 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 12:53:36,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 12:53:36,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 12:53:36,947 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 12:53:36,947 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 12:53:36,947 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 12:53:36,961 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 12:53:36,964 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-09 12:53:36,967 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-09 12:53:36,969 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-09 12:53:37,016 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-09 12:53:37,016 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 12:53:37,021 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-09 12:53:37,025 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-09 12:53:37,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:37,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:37,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:37,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:37,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:37,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:37,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:37,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:37,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:37,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-09 12:53:37,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:37,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-09 12:53:37,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:37,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-09 12:53:37,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:37,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-09 12:53:37,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:38,777 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-09 12:53:38,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-09 12:53:38,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:38,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-09 12:53:38,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:39,689 WARN L193 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-09 12:53:39,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:39,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:39,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:39,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:39,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:40,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:53:40,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:40,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:40,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:40,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:40,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:40,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:40,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:40,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:40,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:40,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:40,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:40,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:40,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:40,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:40,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:40,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:40,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:40,274 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-09 12:53:40,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:53:40,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:40,962 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-10-09 12:53:41,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:41,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:41,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:53:41,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:41,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:41,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:41,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:41,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:41,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:41,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:42,354 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-09 12:53:42,457 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-09 12:53:42,465 INFO L132 LiptonReduction]: Checked pairs total: 4534 [2020-10-09 12:53:42,466 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-09 12:53:42,473 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-09 12:53:42,528 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-09 12:53:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-09 12:53:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-09 12:53:42,537 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:42,538 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-09 12:53:42,538 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-09 12:53:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1000628281, now seen corresponding path program 1 times [2020-10-09 12:53:42,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:42,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581753505] [2020-10-09 12:53:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:42,816 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-09 12:53:42,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581753505] [2020-10-09 12:53:42,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:42,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:53:42,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744498449] [2020-10-09 12:53:42,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:53:42,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:53:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:42,838 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-09 12:53:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:42,945 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-09 12:53:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:53:42,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-09 12:53:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:42,974 INFO L225 Difference]: With dead ends: 812 [2020-10-09 12:53:42,974 INFO L226 Difference]: Without dead ends: 687 [2020-10-09 12:53:42,976 INFO L673 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-09 12:53:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-09 12:53:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-09 12:53:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-09 12:53:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-09 12:53:43,094 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 5 [2020-10-09 12:53:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:43,094 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-09 12:53:43,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:53:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-09 12:53:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-09 12:53:43,100 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:43,100 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:43,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 12:53:43,101 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-09 12:53:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash -439717829, now seen corresponding path program 1 times [2020-10-09 12:53:43,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:43,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099260325] [2020-10-09 12:53:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:43,250 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-09 12:53:43,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099260325] [2020-10-09 12:53:43,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:43,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:53:43,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750105863] [2020-10-09 12:53:43,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:53:43,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:53:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:43,253 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 5 states. [2020-10-09 12:53:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:43,336 INFO L93 Difference]: Finished difference Result 762 states and 2295 transitions. [2020-10-09 12:53:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:53:43,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-09 12:53:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:43,343 INFO L225 Difference]: With dead ends: 762 [2020-10-09 12:53:43,343 INFO L226 Difference]: Without dead ends: 637 [2020-10-09 12:53:43,344 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-09 12:53:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-10-09 12:53:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2020-10-09 12:53:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-10-09 12:53:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2020-10-09 12:53:43,369 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 10 [2020-10-09 12:53:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:43,370 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2020-10-09 12:53:43,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:53:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2020-10-09 12:53:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 12:53:43,372 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:43,373 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:43,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 12:53:43,373 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-09 12:53:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash -746336666, now seen corresponding path program 1 times [2020-10-09 12:53:43,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:43,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027467196] [2020-10-09 12:53:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:43,511 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-09 12:53:43,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027467196] [2020-10-09 12:53:43,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:43,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:53:43,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790206254] [2020-10-09 12:53:43,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:53:43,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:53:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:43,513 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand 5 states. [2020-10-09 12:53:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:43,610 INFO L93 Difference]: Finished difference Result 687 states and 2050 transitions. [2020-10-09 12:53:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:53:43,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-09 12:53:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:43,616 INFO L225 Difference]: With dead ends: 687 [2020-10-09 12:53:43,616 INFO L226 Difference]: Without dead ends: 587 [2020-10-09 12:53:43,616 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-09 12:53:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-10-09 12:53:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2020-10-09 12:53:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-10-09 12:53:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1790 transitions. [2020-10-09 12:53:43,636 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1790 transitions. Word has length 11 [2020-10-09 12:53:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:43,637 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 1790 transitions. [2020-10-09 12:53:43,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:53:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1790 transitions. [2020-10-09 12:53:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-09 12:53:43,639 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:43,640 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:43,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 12:53:43,640 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-09 12:53:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1661624461, now seen corresponding path program 1 times [2020-10-09 12:53:43,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:43,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828226800] [2020-10-09 12:53:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:43,754 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-09 12:53:43,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828226800] [2020-10-09 12:53:43,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:43,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:53:43,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601783990] [2020-10-09 12:53:43,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:53:43,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:43,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:53:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:43,756 INFO L87 Difference]: Start difference. First operand 587 states and 1790 transitions. Second operand 6 states. [2020-10-09 12:53:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:43,952 INFO L93 Difference]: Finished difference Result 1022 states and 3034 transitions. [2020-10-09 12:53:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 12:53:43,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-09 12:53:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:43,956 INFO L225 Difference]: With dead ends: 1022 [2020-10-09 12:53:43,956 INFO L226 Difference]: Without dead ends: 407 [2020-10-09 12:53:43,958 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-09 12:53:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-09 12:53:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-10-09 12:53:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-09 12:53:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1151 transitions. [2020-10-09 12:53:43,971 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1151 transitions. Word has length 12 [2020-10-09 12:53:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:43,971 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1151 transitions. [2020-10-09 12:53:43,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:53:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1151 transitions. [2020-10-09 12:53:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 12:53:43,974 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:43,974 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:43,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 12:53:43,974 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-09 12:53:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1585751897, now seen corresponding path program 1 times [2020-10-09 12:53:43,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:43,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019332109] [2020-10-09 12:53:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:44,100 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-09 12:53:44,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019332109] [2020-10-09 12:53:44,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:44,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:53:44,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438794706] [2020-10-09 12:53:44,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:53:44,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:53:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:44,106 INFO L87 Difference]: Start difference. First operand 407 states and 1151 transitions. Second operand 6 states. [2020-10-09 12:53:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:44,260 INFO L93 Difference]: Finished difference Result 614 states and 1715 transitions. [2020-10-09 12:53:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:53:44,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-09 12:53:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:44,264 INFO L225 Difference]: With dead ends: 614 [2020-10-09 12:53:44,264 INFO L226 Difference]: Without dead ends: 281 [2020-10-09 12:53:44,265 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-09 12:53:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-09 12:53:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2020-10-09 12:53:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-10-09 12:53:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 794 transitions. [2020-10-09 12:53:44,277 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 794 transitions. Word has length 14 [2020-10-09 12:53:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:44,278 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 794 transitions. [2020-10-09 12:53:44,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:53:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 794 transitions. [2020-10-09 12:53:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 12:53:44,279 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:44,279 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:44,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 12:53:44,280 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-09 12:53:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1913245981, now seen corresponding path program 1 times [2020-10-09 12:53:44,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:44,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50141095] [2020-10-09 12:53:44,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:44,403 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-09 12:53:44,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50141095] [2020-10-09 12:53:44,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:44,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:53:44,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519269809] [2020-10-09 12:53:44,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:53:44,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:53:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:44,405 INFO L87 Difference]: Start difference. First operand 281 states and 794 transitions. Second operand 6 states. [2020-10-09 12:53:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:44,477 INFO L93 Difference]: Finished difference Result 425 states and 1202 transitions. [2020-10-09 12:53:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:53:44,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-09 12:53:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:44,482 INFO L225 Difference]: With dead ends: 425 [2020-10-09 12:53:44,482 INFO L226 Difference]: Without dead ends: 245 [2020-10-09 12:53:44,482 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-09 12:53:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-09 12:53:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2020-10-09 12:53:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-09 12:53:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 674 transitions. [2020-10-09 12:53:44,491 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 674 transitions. Word has length 15 [2020-10-09 12:53:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:44,491 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 674 transitions. [2020-10-09 12:53:44,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:53:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 674 transitions. [2020-10-09 12:53:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 12:53:44,493 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:44,493 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:44,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 12:53:44,493 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-09 12:53:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1913678431, now seen corresponding path program 2 times [2020-10-09 12:53:44,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:44,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135074682] [2020-10-09 12:53:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:44,654 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-09 12:53:44,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135074682] [2020-10-09 12:53:44,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:44,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:53:44,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762748595] [2020-10-09 12:53:44,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:53:44,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:53:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:44,657 INFO L87 Difference]: Start difference. First operand 245 states and 674 transitions. Second operand 6 states. [2020-10-09 12:53:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:44,771 INFO L93 Difference]: Finished difference Result 279 states and 742 transitions. [2020-10-09 12:53:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:53:44,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-09 12:53:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:44,773 INFO L225 Difference]: With dead ends: 279 [2020-10-09 12:53:44,774 INFO L226 Difference]: Without dead ends: 243 [2020-10-09 12:53:44,774 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:53:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-10-09 12:53:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2020-10-09 12:53:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-09 12:53:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 666 transitions. [2020-10-09 12:53:44,782 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 666 transitions. Word has length 15 [2020-10-09 12:53:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:44,782 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 666 transitions. [2020-10-09 12:53:44,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:53:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 666 transitions. [2020-10-09 12:53:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 12:53:44,783 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:44,784 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:44,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 12:53:44,784 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-09 12:53:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:44,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1352071390, now seen corresponding path program 1 times [2020-10-09 12:53:44,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:44,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083149734] [2020-10-09 12:53:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:44,898 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-09 12:53:44,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083149734] [2020-10-09 12:53:44,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:44,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:53:44,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125127721] [2020-10-09 12:53:44,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:53:44,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:53:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:53:44,902 INFO L87 Difference]: Start difference. First operand 243 states and 666 transitions. Second operand 4 states. [2020-10-09 12:53:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:44,936 INFO L93 Difference]: Finished difference Result 230 states and 548 transitions. [2020-10-09 12:53:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:53:44,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-09 12:53:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:44,938 INFO L225 Difference]: With dead ends: 230 [2020-10-09 12:53:44,938 INFO L226 Difference]: Without dead ends: 177 [2020-10-09 12:53:44,938 INFO L673 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-09 12:53:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-09 12:53:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-10-09 12:53:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-09 12:53:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 418 transitions. [2020-10-09 12:53:44,944 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 418 transitions. Word has length 16 [2020-10-09 12:53:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:44,944 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 418 transitions. [2020-10-09 12:53:44,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:53:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 418 transitions. [2020-10-09 12:53:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 12:53:44,945 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:44,945 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:44,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 12:53:44,945 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-09 12:53:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash -387753220, now seen corresponding path program 1 times [2020-10-09 12:53:44,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:44,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570853136] [2020-10-09 12:53:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:45,003 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-09 12:53:45,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570853136] [2020-10-09 12:53:45,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:45,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:53:45,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716862156] [2020-10-09 12:53:45,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:53:45,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:53:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:45,005 INFO L87 Difference]: Start difference. First operand 177 states and 418 transitions. Second operand 5 states. [2020-10-09 12:53:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:45,050 INFO L93 Difference]: Finished difference Result 132 states and 266 transitions. [2020-10-09 12:53:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:53:45,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-09 12:53:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:45,051 INFO L225 Difference]: With dead ends: 132 [2020-10-09 12:53:45,051 INFO L226 Difference]: Without dead ends: 101 [2020-10-09 12:53:45,052 INFO L673 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-09 12:53:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-09 12:53:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-09 12:53:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-09 12:53:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 194 transitions. [2020-10-09 12:53:45,055 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 194 transitions. Word has length 17 [2020-10-09 12:53:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:45,055 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 194 transitions. [2020-10-09 12:53:45,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:53:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 194 transitions. [2020-10-09 12:53:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 12:53:45,056 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:45,056 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:45,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 12:53:45,057 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-09 12:53:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash -827287650, now seen corresponding path program 1 times [2020-10-09 12:53:45,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:45,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245125885] [2020-10-09 12:53:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:45,141 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-09 12:53:45,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245125885] [2020-10-09 12:53:45,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:45,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:53:45,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145579446] [2020-10-09 12:53:45,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:53:45,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:53:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:45,143 INFO L87 Difference]: Start difference. First operand 101 states and 194 transitions. Second operand 6 states. [2020-10-09 12:53:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:45,186 INFO L93 Difference]: Finished difference Result 80 states and 150 transitions. [2020-10-09 12:53:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:53:45,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-09 12:53:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:45,187 INFO L225 Difference]: With dead ends: 80 [2020-10-09 12:53:45,187 INFO L226 Difference]: Without dead ends: 71 [2020-10-09 12:53:45,188 INFO L673 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-09 12:53:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-09 12:53:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-09 12:53:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-09 12:53:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2020-10-09 12:53:45,190 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 19 [2020-10-09 12:53:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:45,191 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2020-10-09 12:53:45,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:53:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2020-10-09 12:53:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:53:45,192 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:45,192 INFO L421 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-09 12:53:45,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 12:53:45,192 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-09 12:53:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash -475365152, now seen corresponding path program 1 times [2020-10-09 12:53:45,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:45,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816566431] [2020-10-09 12:53:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:45,366 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-09 12:53:45,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816566431] [2020-10-09 12:53:45,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:45,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 12:53:45,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350069067] [2020-10-09 12:53:45,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 12:53:45,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 12:53:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-09 12:53:45,369 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand 9 states. [2020-10-09 12:53:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:45,527 INFO L93 Difference]: Finished difference Result 92 states and 170 transitions. [2020-10-09 12:53:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:53:45,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-09 12:53:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:45,528 INFO L225 Difference]: With dead ends: 92 [2020-10-09 12:53:45,528 INFO L226 Difference]: Without dead ends: 51 [2020-10-09 12:53:45,529 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-09 12:53:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-09 12:53:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-09 12:53:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-09 12:53:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-10-09 12:53:45,531 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2020-10-09 12:53:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:45,531 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-10-09 12:53:45,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 12:53:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-10-09 12:53:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:53:45,532 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:45,532 INFO L421 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-09 12:53:45,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 12:53:45,532 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-09 12:53:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:45,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1319311854, now seen corresponding path program 2 times [2020-10-09 12:53:45,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:45,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52111845] [2020-10-09 12:53:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:53:45,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:53:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:53:45,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:53:45,702 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 12:53:45,702 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 12:53:45,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 12:53:45,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,741 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-09 12:53:45,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,741 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-09 12:53:45,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,742 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-09 12:53:45,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,742 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-09 12:53:45,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,743 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-09 12:53:45,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,744 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-09 12:53:45,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,745 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-09 12:53:45,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,745 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-09 12:53:45,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,746 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,746 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,747 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,747 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:53:45,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,754 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-09 12:53:45,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,754 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-09 12:53:45,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,755 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-09 12:53:45,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,755 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-09 12:53:45,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,756 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-09 12:53:45,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,757 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-09 12:53:45,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,757 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-09 12:53:45,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,758 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-09 12:53:45,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,758 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-09 12:53:45,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,759 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-09 12:53:45,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,759 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-09 12:53:45,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,759 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-09 12:53:45,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,760 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-09 12:53:45,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,760 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-09 12:53:45,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,760 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-09 12:53:45,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,761 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-09 12:53:45,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,762 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-09 12:53:45,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,762 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-09 12:53:45,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,762 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-09 12:53:45,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:53:45,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:53:45 BasicIcfg [2020-10-09 12:53:45,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 12:53:45,879 INFO L168 Benchmark]: Toolchain (without parser) took 12085.33 ms. Allocated memory was 252.2 MB in the beginning and 496.0 MB in the end (delta: 243.8 MB). Free memory was 208.1 MB in the beginning and 292.6 MB in the end (delta: -84.5 MB). Peak memory consumption was 159.3 MB. Max. memory is 14.2 GB. [2020-10-09 12:53:45,880 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:53:45,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.65 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 208.1 MB in the beginning and 268.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. [2020-10-09 12:53:45,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.01 ms. Allocated memory is still 318.2 MB. Free memory was 268.8 MB in the beginning and 263.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-09 12:53:45,885 INFO L168 Benchmark]: Boogie Preprocessor took 44.16 ms. Allocated memory is still 318.2 MB. Free memory was 263.7 MB in the beginning and 261.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:53:45,886 INFO L168 Benchmark]: RCFGBuilder took 2168.05 ms. Allocated memory was 318.2 MB in the beginning and 361.2 MB in the end (delta: 43.0 MB). Free memory was 261.2 MB in the beginning and 184.3 MB in the end (delta: 76.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 14.2 GB. [2020-10-09 12:53:45,887 INFO L168 Benchmark]: TraceAbstraction took 9055.36 ms. Allocated memory was 361.2 MB in the beginning and 496.0 MB in the end (delta: 134.7 MB). Free memory was 184.3 MB in the beginning and 292.6 MB in the end (delta: -108.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 14.2 GB. [2020-10-09 12:53:45,900 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.26 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 729.65 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 208.1 MB in the beginning and 268.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 81.01 ms. Allocated memory is still 318.2 MB. Free memory was 268.8 MB in the beginning and 263.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.16 ms. Allocated memory is still 318.2 MB. Free memory was 263.7 MB in the beginning and 261.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2168.05 ms. Allocated memory was 318.2 MB in the beginning and 361.2 MB in the end (delta: 43.0 MB). Free memory was 261.2 MB in the beginning and 184.3 MB in the end (delta: 76.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9055.36 ms. Allocated memory was 361.2 MB in the beginning and 496.0 MB in the end (delta: 134.7 MB). Free memory was 184.3 MB in the beginning and 292.6 MB in the end (delta: -108.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1035 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 99 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 100 PlacesBefore, 37 PlacesAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4534 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; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1882; [L808] FCALL, FORK 0 pthread_create(&t1882, ((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] [L809] 0 pthread_t t1883; [L810] FCALL, FORK 0 pthread_create(&t1883, ((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] [L811] 0 pthread_t t1884; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 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] [L762] 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] [L812] FCALL, FORK 0 pthread_create(&t1884, ((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] [L779] 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] [L782] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=2] [L765] 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) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] 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) [L765] 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) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 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 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 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 [L785] 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) [L785] 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) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 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 [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 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 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] 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) [L736] 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) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 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 [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 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 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L818] 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) [L818] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L818] 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) [L818] 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) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 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 [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 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 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] 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) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] 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) [L829] 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) [L830] 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)) [L830] 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) [L830] 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)) [L830] 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)) [L831] 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)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] 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)) [L831] 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)) [L832] 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)) [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_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [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_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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) [L835] 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)) [L835] 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)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 277 SDtfs, 430 SDslu, 584 SDs, 0 SdLazy, 339 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 15894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...