/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/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:24:24,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:24:24,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:24:24,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:24:24,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:24:24,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:24:24,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:24:24,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:24:24,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:24:24,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:24:24,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:24:24,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:24:24,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:24:24,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:24:24,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:24:24,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:24:24,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:24:24,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:24:24,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:24:24,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:24:24,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:24:24,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:24:24,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:24:24,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:24:24,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:24:24,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:24:24,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:24:24,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:24:24,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:24:24,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:24:24,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:24:24,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:24:24,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:24:24,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:24:24,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:24:24,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:24:24,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:24:24,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:24:24,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:24:24,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:24:24,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:24:24,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:24:24,647 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:24:24,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:24:24,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:24:24,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:24:24,650 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:24:24,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:24:24,651 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:24:24,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:24:24,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:24:24,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:24:24,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:24:24,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:24:24,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:24:24,654 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:24:24,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:24:24,654 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:24:24,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:24:24,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:24:24,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:24:24,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:24:24,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:24:24,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:24:24,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:24:24,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:24:24,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:24:24,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:24:24,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:24:24,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:24:24,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:24:24,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:24:24,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:24:24,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:24:24,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:24:24,995 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:24:24,996 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:24:24,997 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-15 18:24:25,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972ced6b8/0a033fd2bd634d138e6cef2e62f6034f/FLAG97e14f581 [2020-10-15 18:24:25,574 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:24:25,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-15 18:24:25,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972ced6b8/0a033fd2bd634d138e6cef2e62f6034f/FLAG97e14f581 [2020-10-15 18:24:25,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972ced6b8/0a033fd2bd634d138e6cef2e62f6034f [2020-10-15 18:24:25,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:24:25,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:24:25,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:24:25,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:24:25,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:24:25,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:24:25" (1/1) ... [2020-10-15 18:24:25,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645ed8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:25, skipping insertion in model container [2020-10-15 18:24:25,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:24:25" (1/1) ... [2020-10-15 18:24:25,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:24:25,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:24:26,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:24:26,519 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:24:26,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:24:26,666 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:24:26,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26 WrapperNode [2020-10-15 18:24:26,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:24:26,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:24:26,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:24:26,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:24:26,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:24:26,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:24:26,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:24:26,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:24:26,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... [2020-10-15 18:24:26,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:24:26,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:24:26,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:24:26,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:24:26,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:24:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:24:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:24:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:24:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:24:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:24:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:24:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:24:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:24:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:24:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:24:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:24:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:24:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:24:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:24:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:24:26,868 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:24:28,936 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:24:28,936 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:24:28,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:24:28 BoogieIcfgContainer [2020-10-15 18:24:28,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:24:28,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:24:28,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:24:28,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:24:28,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:24:25" (1/3) ... [2020-10-15 18:24:28,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526411c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:24:28, skipping insertion in model container [2020-10-15 18:24:28,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:26" (2/3) ... [2020-10-15 18:24:28,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526411c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:24:28, skipping insertion in model container [2020-10-15 18:24:28,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:24:28" (3/3) ... [2020-10-15 18:24:28,947 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2020-10-15 18:24:28,960 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:24:28,960 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:24:28,968 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:24:28,969 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:24:28,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:28,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:28,999 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:28,999 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:28,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:28,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,000 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,000 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,005 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,006 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,006 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,006 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,009 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,013 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,014 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,016 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,018 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,019 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,020 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,021 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:29,039 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:24:29,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:24:29,060 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:24:29,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:24:29,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:24:29,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:24:29,061 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:24:29,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:24:29,061 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:24:29,075 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:24:29,078 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-15 18:24:29,081 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-15 18:24:29,084 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-15 18:24:29,138 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-15 18:24:29,139 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:24:29,144 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-15 18:24:29,149 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-15 18:24:29,478 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:24:29,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:29,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:24:29,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:29,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:29,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:29,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:29,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:29,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 18:24:29,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:30,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:30,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:30,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:30,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:30,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:30,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:30,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,182 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-15 18:24:31,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-15 18:24:31,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:31,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,325 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-15 18:24:32,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:32,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:32,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:32,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:32,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:32,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 18:24:32,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:32,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:32,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:32,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:32,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:32,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:32,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:32,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:32,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:32,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:24:32,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:32,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:33,295 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-15 18:24:33,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:24:33,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:33,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:33,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:33,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:24:33,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:33,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:33,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:33,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:33,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:33,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:33,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:33,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:33,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:33,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:33,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:33,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:33,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:33,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:33,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:33,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:33,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:33,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:33,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:34,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:24:34,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:34,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:34,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:34,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:34,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:34,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:34,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:34,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:24:34,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:34,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:34,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:34,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:34,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:34,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:34,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:34,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:34,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:34,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:34,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:34,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:34,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:34,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:34,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:35,276 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-15 18:24:35,408 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-15 18:24:35,419 INFO L132 LiptonReduction]: Checked pairs total: 6555 [2020-10-15 18:24:35,419 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-15 18:24:35,435 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 18:24:35,679 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-10-15 18:24:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-10-15 18:24:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:24:35,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:35,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:35,694 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2065333905, now seen corresponding path program 1 times [2020-10-15 18:24:35,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:35,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932851722] [2020-10-15 18:24:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:35,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932851722] [2020-10-15 18:24:35,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:35,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:24:35,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672598201] [2020-10-15 18:24:35,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:24:35,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:35,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:24:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:24:35,994 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-10-15 18:24:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:36,121 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-15 18:24:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:24:36,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:24:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:36,165 INFO L225 Difference]: With dead ends: 2602 [2020-10-15 18:24:36,165 INFO L226 Difference]: Without dead ends: 2202 [2020-10-15 18:24:36,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:24:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-10-15 18:24:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-10-15 18:24:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 18:24:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-10-15 18:24:36,350 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-10-15 18:24:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:36,351 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-10-15 18:24:36,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:24:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-10-15 18:24:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:24:36,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:36,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:36,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:24:36,362 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1342131682, now seen corresponding path program 1 times [2020-10-15 18:24:36,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:36,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232010912] [2020-10-15 18:24:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:36,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232010912] [2020-10-15 18:24:36,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:36,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:24:36,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181124447] [2020-10-15 18:24:36,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:24:36,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:24:36,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:24:36,564 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-10-15 18:24:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:36,657 INFO L93 Difference]: Finished difference Result 2502 states and 9254 transitions. [2020-10-15 18:24:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:36,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 18:24:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:36,676 INFO L225 Difference]: With dead ends: 2502 [2020-10-15 18:24:36,677 INFO L226 Difference]: Without dead ends: 2102 [2020-10-15 18:24:36,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-10-15 18:24:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102. [2020-10-15 18:24:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-10-15 18:24:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions. [2020-10-15 18:24:36,843 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12 [2020-10-15 18:24:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:36,843 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions. [2020-10-15 18:24:36,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:24:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions. [2020-10-15 18:24:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:24:36,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:36,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:36,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:24:36,847 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1343575012, now seen corresponding path program 1 times [2020-10-15 18:24:36,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:36,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265058013] [2020-10-15 18:24:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:37,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265058013] [2020-10-15 18:24:37,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:37,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:37,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674417056] [2020-10-15 18:24:37,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:37,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:37,073 INFO L87 Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 5 states. [2020-10-15 18:24:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:37,193 INFO L93 Difference]: Finished difference Result 2396 states and 8804 transitions. [2020-10-15 18:24:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:37,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:24:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:37,212 INFO L225 Difference]: With dead ends: 2396 [2020-10-15 18:24:37,212 INFO L226 Difference]: Without dead ends: 2046 [2020-10-15 18:24:37,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-10-15 18:24:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2020-10-15 18:24:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2020-10-15 18:24:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 7716 transitions. [2020-10-15 18:24:37,304 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 7716 transitions. Word has length 13 [2020-10-15 18:24:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:37,305 INFO L481 AbstractCegarLoop]: Abstraction has 2046 states and 7716 transitions. [2020-10-15 18:24:37,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 7716 transitions. [2020-10-15 18:24:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:24:37,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:37,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:37,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:24:37,310 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -701214973, now seen corresponding path program 1 times [2020-10-15 18:24:37,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:37,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304742622] [2020-10-15 18:24:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:37,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304742622] [2020-10-15 18:24:37,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:37,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:37,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572260645] [2020-10-15 18:24:37,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:37,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:37,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:37,525 INFO L87 Difference]: Start difference. First operand 2046 states and 7716 transitions. Second operand 5 states. [2020-10-15 18:24:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:37,668 INFO L93 Difference]: Finished difference Result 2214 states and 8110 transitions. [2020-10-15 18:24:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:37,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 18:24:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:37,685 INFO L225 Difference]: With dead ends: 2214 [2020-10-15 18:24:37,686 INFO L226 Difference]: Without dead ends: 1934 [2020-10-15 18:24:37,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-10-15 18:24:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2020-10-15 18:24:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-10-15 18:24:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 7220 transitions. [2020-10-15 18:24:37,759 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 7220 transitions. Word has length 14 [2020-10-15 18:24:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:37,759 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 7220 transitions. [2020-10-15 18:24:37,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 7220 transitions. [2020-10-15 18:24:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:24:37,763 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:37,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:37,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:24:37,763 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1610053253, now seen corresponding path program 1 times [2020-10-15 18:24:37,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:37,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893646923] [2020-10-15 18:24:37,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:37,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893646923] [2020-10-15 18:24:37,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:37,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:37,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420143182] [2020-10-15 18:24:37,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:37,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:37,870 INFO L87 Difference]: Start difference. First operand 1934 states and 7220 transitions. Second operand 5 states. [2020-10-15 18:24:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:37,996 INFO L93 Difference]: Finished difference Result 2240 states and 8152 transitions. [2020-10-15 18:24:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:37,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:24:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:38,014 INFO L225 Difference]: With dead ends: 2240 [2020-10-15 18:24:38,014 INFO L226 Difference]: Without dead ends: 2002 [2020-10-15 18:24:38,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2020-10-15 18:24:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1946. [2020-10-15 18:24:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-15 18:24:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7200 transitions. [2020-10-15 18:24:38,093 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7200 transitions. Word has length 15 [2020-10-15 18:24:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:38,093 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 7200 transitions. [2020-10-15 18:24:38,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7200 transitions. [2020-10-15 18:24:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:24:38,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:38,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:38,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:24:38,098 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash 666758434, now seen corresponding path program 1 times [2020-10-15 18:24:38,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:38,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173477260] [2020-10-15 18:24:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:38,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173477260] [2020-10-15 18:24:38,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:38,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:38,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768809972] [2020-10-15 18:24:38,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:24:38,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:24:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:24:38,187 INFO L87 Difference]: Start difference. First operand 1946 states and 7200 transitions. Second operand 4 states. [2020-10-15 18:24:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:38,240 INFO L93 Difference]: Finished difference Result 1974 states and 6669 transitions. [2020-10-15 18:24:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:38,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:24:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:38,252 INFO L225 Difference]: With dead ends: 1974 [2020-10-15 18:24:38,253 INFO L226 Difference]: Without dead ends: 1542 [2020-10-15 18:24:38,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2020-10-15 18:24:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2020-10-15 18:24:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2020-10-15 18:24:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 5180 transitions. [2020-10-15 18:24:38,306 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 5180 transitions. Word has length 16 [2020-10-15 18:24:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:38,306 INFO L481 AbstractCegarLoop]: Abstraction has 1542 states and 5180 transitions. [2020-10-15 18:24:38,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:24:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 5180 transitions. [2020-10-15 18:24:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:24:38,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:38,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:38,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:24:38,311 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1803367302, now seen corresponding path program 1 times [2020-10-15 18:24:38,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:38,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341976979] [2020-10-15 18:24:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:38,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341976979] [2020-10-15 18:24:38,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:38,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:24:38,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192707222] [2020-10-15 18:24:38,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:38,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:38,421 INFO L87 Difference]: Start difference. First operand 1542 states and 5180 transitions. Second operand 5 states. [2020-10-15 18:24:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:38,485 INFO L93 Difference]: Finished difference Result 1259 states and 3839 transitions. [2020-10-15 18:24:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:38,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:24:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:38,502 INFO L225 Difference]: With dead ends: 1259 [2020-10-15 18:24:38,503 INFO L226 Difference]: Without dead ends: 980 [2020-10-15 18:24:38,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2020-10-15 18:24:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2020-10-15 18:24:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2020-10-15 18:24:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2932 transitions. [2020-10-15 18:24:38,538 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2932 transitions. Word has length 17 [2020-10-15 18:24:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:38,539 INFO L481 AbstractCegarLoop]: Abstraction has 980 states and 2932 transitions. [2020-10-15 18:24:38,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2932 transitions. [2020-10-15 18:24:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:38,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:38,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:38,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:24:38,543 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash 690303399, now seen corresponding path program 1 times [2020-10-15 18:24:38,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:38,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259224025] [2020-10-15 18:24:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:38,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259224025] [2020-10-15 18:24:38,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:38,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:24:38,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522662827] [2020-10-15 18:24:38,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:24:38,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:24:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:24:38,715 INFO L87 Difference]: Start difference. First operand 980 states and 2932 transitions. Second operand 9 states. [2020-10-15 18:24:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:38,914 INFO L93 Difference]: Finished difference Result 1362 states and 4014 transitions. [2020-10-15 18:24:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 18:24:38,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-15 18:24:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:38,919 INFO L225 Difference]: With dead ends: 1362 [2020-10-15 18:24:38,920 INFO L226 Difference]: Without dead ends: 980 [2020-10-15 18:24:38,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:24:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2020-10-15 18:24:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2020-10-15 18:24:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2020-10-15 18:24:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2908 transitions. [2020-10-15 18:24:38,947 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2908 transitions. Word has length 19 [2020-10-15 18:24:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:38,947 INFO L481 AbstractCegarLoop]: Abstraction has 980 states and 2908 transitions. [2020-10-15 18:24:38,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:24:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2908 transitions. [2020-10-15 18:24:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:38,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:38,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:38,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:24:38,950 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:38,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash -983913715, now seen corresponding path program 2 times [2020-10-15 18:24:38,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:38,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313775606] [2020-10-15 18:24:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:39,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313775606] [2020-10-15 18:24:39,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:39,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:24:39,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915336368] [2020-10-15 18:24:39,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:24:39,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:24:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:39,074 INFO L87 Difference]: Start difference. First operand 980 states and 2908 transitions. Second operand 7 states. [2020-10-15 18:24:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:39,270 INFO L93 Difference]: Finished difference Result 1428 states and 4055 transitions. [2020-10-15 18:24:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:24:39,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-15 18:24:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:39,275 INFO L225 Difference]: With dead ends: 1428 [2020-10-15 18:24:39,275 INFO L226 Difference]: Without dead ends: 1165 [2020-10-15 18:24:39,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:24:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-10-15 18:24:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1109. [2020-10-15 18:24:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-10-15 18:24:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 3228 transitions. [2020-10-15 18:24:39,305 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 3228 transitions. Word has length 19 [2020-10-15 18:24:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:39,306 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 3228 transitions. [2020-10-15 18:24:39,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:24:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 3228 transitions. [2020-10-15 18:24:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:39,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:39,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:39,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:24:39,309 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 712475296, now seen corresponding path program 1 times [2020-10-15 18:24:39,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:39,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240621931] [2020-10-15 18:24:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:39,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240621931] [2020-10-15 18:24:39,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:39,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:39,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219007969] [2020-10-15 18:24:39,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:39,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:39,379 INFO L87 Difference]: Start difference. First operand 1109 states and 3228 transitions. Second operand 5 states. [2020-10-15 18:24:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:39,471 INFO L93 Difference]: Finished difference Result 1262 states and 3629 transitions. [2020-10-15 18:24:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:24:39,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-15 18:24:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:39,476 INFO L225 Difference]: With dead ends: 1262 [2020-10-15 18:24:39,476 INFO L226 Difference]: Without dead ends: 1229 [2020-10-15 18:24:39,477 INFO L677 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-15 18:24:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-10-15 18:24:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2020-10-15 18:24:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2020-10-15 18:24:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 3561 transitions. [2020-10-15 18:24:39,508 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 3561 transitions. Word has length 19 [2020-10-15 18:24:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:39,508 INFO L481 AbstractCegarLoop]: Abstraction has 1225 states and 3561 transitions. [2020-10-15 18:24:39,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 3561 transitions. [2020-10-15 18:24:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:39,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:39,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:39,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:24:39,512 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1923521869, now seen corresponding path program 3 times [2020-10-15 18:24:39,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:39,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454053434] [2020-10-15 18:24:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:39,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454053434] [2020-10-15 18:24:39,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:39,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:39,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520062020] [2020-10-15 18:24:39,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:24:39,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:24:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:24:39,562 INFO L87 Difference]: Start difference. First operand 1225 states and 3561 transitions. Second operand 4 states. [2020-10-15 18:24:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:39,594 INFO L93 Difference]: Finished difference Result 1640 states and 4587 transitions. [2020-10-15 18:24:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:39,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-15 18:24:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:39,598 INFO L225 Difference]: With dead ends: 1640 [2020-10-15 18:24:39,599 INFO L226 Difference]: Without dead ends: 1133 [2020-10-15 18:24:39,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-10-15 18:24:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1089. [2020-10-15 18:24:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2020-10-15 18:24:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 3003 transitions. [2020-10-15 18:24:39,626 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 3003 transitions. Word has length 19 [2020-10-15 18:24:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:39,627 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 3003 transitions. [2020-10-15 18:24:39,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:24:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 3003 transitions. [2020-10-15 18:24:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:39,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:39,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:39,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:24:39,630 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash -217914650, now seen corresponding path program 1 times [2020-10-15 18:24:39,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:39,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876536761] [2020-10-15 18:24:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:39,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876536761] [2020-10-15 18:24:39,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:39,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:24:39,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373035553] [2020-10-15 18:24:39,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:24:39,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:24:39,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:39,730 INFO L87 Difference]: Start difference. First operand 1089 states and 3003 transitions. Second operand 6 states. [2020-10-15 18:24:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:39,793 INFO L93 Difference]: Finished difference Result 909 states and 2434 transitions. [2020-10-15 18:24:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:24:39,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:24:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:39,796 INFO L225 Difference]: With dead ends: 909 [2020-10-15 18:24:39,797 INFO L226 Difference]: Without dead ends: 765 [2020-10-15 18:24:39,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2020-10-15 18:24:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 753. [2020-10-15 18:24:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2020-10-15 18:24:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 2026 transitions. [2020-10-15 18:24:39,818 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 2026 transitions. Word has length 19 [2020-10-15 18:24:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:39,818 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 2026 transitions. [2020-10-15 18:24:39,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:24:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 2026 transitions. [2020-10-15 18:24:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:24:39,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:39,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:39,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:24:39,821 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:39,821 INFO L82 PathProgramCache]: Analyzing trace with hash 117793056, now seen corresponding path program 1 times [2020-10-15 18:24:39,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:39,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061211308] [2020-10-15 18:24:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:39,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061211308] [2020-10-15 18:24:39,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:39,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:24:39,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777819113] [2020-10-15 18:24:39,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:24:39,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:24:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:24:39,984 INFO L87 Difference]: Start difference. First operand 753 states and 2026 transitions. Second operand 9 states. [2020-10-15 18:24:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:40,126 INFO L93 Difference]: Finished difference Result 844 states and 2257 transitions. [2020-10-15 18:24:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 18:24:40,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 18:24:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:40,130 INFO L225 Difference]: With dead ends: 844 [2020-10-15 18:24:40,130 INFO L226 Difference]: Without dead ends: 839 [2020-10-15 18:24:40,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:24:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-10-15 18:24:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 803. [2020-10-15 18:24:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-10-15 18:24:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2162 transitions. [2020-10-15 18:24:40,157 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 2162 transitions. Word has length 22 [2020-10-15 18:24:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:40,157 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 2162 transitions. [2020-10-15 18:24:40,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:24:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 2162 transitions. [2020-10-15 18:24:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:24:40,161 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:40,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:40,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:24:40,161 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1142060412, now seen corresponding path program 2 times [2020-10-15 18:24:40,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:40,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939334776] [2020-10-15 18:24:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:40,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939334776] [2020-10-15 18:24:40,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:40,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:24:40,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128146590] [2020-10-15 18:24:40,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:24:40,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:24:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:24:40,261 INFO L87 Difference]: Start difference. First operand 803 states and 2162 transitions. Second operand 10 states. [2020-10-15 18:24:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:40,456 INFO L93 Difference]: Finished difference Result 1057 states and 2742 transitions. [2020-10-15 18:24:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:24:40,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-15 18:24:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:40,460 INFO L225 Difference]: With dead ends: 1057 [2020-10-15 18:24:40,460 INFO L226 Difference]: Without dead ends: 761 [2020-10-15 18:24:40,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-15 18:24:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-15 18:24:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 759. [2020-10-15 18:24:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2020-10-15 18:24:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1928 transitions. [2020-10-15 18:24:40,479 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1928 transitions. Word has length 22 [2020-10-15 18:24:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:40,480 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 1928 transitions. [2020-10-15 18:24:40,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:24:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1928 transitions. [2020-10-15 18:24:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:24:40,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:40,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:40,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:24:40,483 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1761972064, now seen corresponding path program 3 times [2020-10-15 18:24:40,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:40,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530692519] [2020-10-15 18:24:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:40,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530692519] [2020-10-15 18:24:40,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:40,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:24:40,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697665928] [2020-10-15 18:24:40,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:24:40,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:24:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:24:40,597 INFO L87 Difference]: Start difference. First operand 759 states and 1928 transitions. Second operand 10 states. [2020-10-15 18:24:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:40,798 INFO L93 Difference]: Finished difference Result 865 states and 2110 transitions. [2020-10-15 18:24:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:24:40,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-15 18:24:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:40,801 INFO L225 Difference]: With dead ends: 865 [2020-10-15 18:24:40,801 INFO L226 Difference]: Without dead ends: 695 [2020-10-15 18:24:40,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:24:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-10-15 18:24:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 646. [2020-10-15 18:24:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-10-15 18:24:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1584 transitions. [2020-10-15 18:24:40,821 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1584 transitions. Word has length 22 [2020-10-15 18:24:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:40,821 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 1584 transitions. [2020-10-15 18:24:40,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:24:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1584 transitions. [2020-10-15 18:24:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:24:40,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:40,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:40,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:24:40,824 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2147199299, now seen corresponding path program 1 times [2020-10-15 18:24:40,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:40,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371695619] [2020-10-15 18:24:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:40,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371695619] [2020-10-15 18:24:40,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:40,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:24:40,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423222254] [2020-10-15 18:24:40,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:24:40,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:24:40,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:40,924 INFO L87 Difference]: Start difference. First operand 646 states and 1584 transitions. Second operand 7 states. [2020-10-15 18:24:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:41,045 INFO L93 Difference]: Finished difference Result 607 states and 1504 transitions. [2020-10-15 18:24:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:24:41,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 18:24:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:41,047 INFO L225 Difference]: With dead ends: 607 [2020-10-15 18:24:41,047 INFO L226 Difference]: Without dead ends: 386 [2020-10-15 18:24:41,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:24:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2020-10-15 18:24:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 378. [2020-10-15 18:24:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-10-15 18:24:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 933 transitions. [2020-10-15 18:24:41,057 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 933 transitions. Word has length 22 [2020-10-15 18:24:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:41,057 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 933 transitions. [2020-10-15 18:24:41,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:24:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 933 transitions. [2020-10-15 18:24:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:24:41,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:41,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:41,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:24:41,059 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2103824024, now seen corresponding path program 1 times [2020-10-15 18:24:41,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:41,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406183333] [2020-10-15 18:24:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:41,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406183333] [2020-10-15 18:24:41,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:41,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:24:41,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016962833] [2020-10-15 18:24:41,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:24:41,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:24:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:24:41,205 INFO L87 Difference]: Start difference. First operand 378 states and 933 transitions. Second operand 9 states. [2020-10-15 18:24:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:41,359 INFO L93 Difference]: Finished difference Result 506 states and 1205 transitions. [2020-10-15 18:24:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:24:41,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-15 18:24:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:41,360 INFO L225 Difference]: With dead ends: 506 [2020-10-15 18:24:41,360 INFO L226 Difference]: Without dead ends: 186 [2020-10-15 18:24:41,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:24:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-15 18:24:41,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-15 18:24:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-15 18:24:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 435 transitions. [2020-10-15 18:24:41,366 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 435 transitions. Word has length 26 [2020-10-15 18:24:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:41,366 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 435 transitions. [2020-10-15 18:24:41,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:24:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 435 transitions. [2020-10-15 18:24:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:24:41,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:41,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:41,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:24:41,367 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash -250477544, now seen corresponding path program 2 times [2020-10-15 18:24:41,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:41,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113922506] [2020-10-15 18:24:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:24:41,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113922506] [2020-10-15 18:24:41,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:41,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:24:41,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560355558] [2020-10-15 18:24:41,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:24:41,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:24:41,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:24:41,530 INFO L87 Difference]: Start difference. First operand 186 states and 435 transitions. Second operand 8 states. [2020-10-15 18:24:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:41,628 INFO L93 Difference]: Finished difference Result 249 states and 569 transitions. [2020-10-15 18:24:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:41,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-15 18:24:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:41,629 INFO L225 Difference]: With dead ends: 249 [2020-10-15 18:24:41,629 INFO L226 Difference]: Without dead ends: 140 [2020-10-15 18:24:41,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:24:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-15 18:24:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-10-15 18:24:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-15 18:24:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 299 transitions. [2020-10-15 18:24:41,633 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 299 transitions. Word has length 26 [2020-10-15 18:24:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:41,633 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 299 transitions. [2020-10-15 18:24:41,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:24:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 299 transitions. [2020-10-15 18:24:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:24:41,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:41,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:41,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:24:41,635 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash -694662336, now seen corresponding path program 3 times [2020-10-15 18:24:41,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:41,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958686690] [2020-10-15 18:24:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:24:41,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:24:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:24:41,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:24:41,738 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:24:41,738 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:24:41,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:24:41,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-15 18:24:41,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,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-15 18:24:41,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:24:41,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:41,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:24:41 BasicIcfg [2020-10-15 18:24:41,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:24:41,856 INFO L168 Benchmark]: Toolchain (without parser) took 16009.59 ms. Allocated memory was 249.0 MB in the beginning and 577.2 MB in the end (delta: 328.2 MB). Free memory was 202.3 MB in the beginning and 362.2 MB in the end (delta: -159.9 MB). Peak memory consumption was 168.3 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:41,857 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 249.0 MB. Free memory is still 222.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:24:41,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.76 ms. Allocated memory was 249.0 MB in the beginning and 304.6 MB in the end (delta: 55.6 MB). Free memory was 202.3 MB in the beginning and 252.9 MB in the end (delta: -50.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:41,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.46 ms. Allocated memory is still 304.6 MB. Free memory was 252.9 MB in the beginning and 247.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:41,861 INFO L168 Benchmark]: Boogie Preprocessor took 61.95 ms. Allocated memory is still 304.6 MB. Free memory was 247.9 MB in the beginning and 245.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:41,861 INFO L168 Benchmark]: RCFGBuilder took 2137.02 ms. Allocated memory was 304.6 MB in the beginning and 355.5 MB in the end (delta: 50.9 MB). Free memory was 245.4 MB in the beginning and 201.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 95.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:41,864 INFO L168 Benchmark]: TraceAbstraction took 12913.77 ms. Allocated memory was 355.5 MB in the beginning and 577.2 MB in the end (delta: 221.8 MB). Free memory was 201.1 MB in the beginning and 362.2 MB in the end (delta: -161.1 MB). Peak memory consumption was 60.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:41,870 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 249.0 MB. Free memory is still 222.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 819.76 ms. Allocated memory was 249.0 MB in the beginning and 304.6 MB in the end (delta: 55.6 MB). Free memory was 202.3 MB in the beginning and 252.9 MB in the end (delta: -50.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.46 ms. Allocated memory is still 304.6 MB. Free memory was 252.9 MB in the beginning and 247.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 61.95 ms. Allocated memory is still 304.6 MB. Free memory was 247.9 MB in the beginning and 245.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2137.02 ms. Allocated memory was 304.6 MB in the beginning and 355.5 MB in the end (delta: 50.9 MB). Free memory was 245.4 MB in the beginning and 201.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 95.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12913.77 ms. Allocated memory was 355.5 MB in the beginning and 577.2 MB in the end (delta: 221.8 MB). Free memory was 201.1 MB in the beginning and 362.2 MB in the end (delta: -161.1 MB). Peak memory consumption was 60.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1465 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 154 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.3s, 119 PlacesBefore, 45 PlacesAfterwards, 108 TransitionsBefore, 33 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 6555 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1485; [L826] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1486; [L828] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1487; [L830] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1488; [L832] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L838] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L841] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L841] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 742 SDtfs, 999 SDslu, 2079 SDs, 0 SdLazy, 903 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 267 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 42237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...