/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/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:04:00,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:04:00,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:04:00,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:04:00,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:04:00,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:04:00,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:04:00,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:04:00,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:04:00,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:04:00,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:04:00,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:04:00,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:04:00,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:04:00,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:04:00,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:04:00,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:04:00,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:04:00,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:04:00,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:04:00,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:04:00,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:04:00,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:04:00,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:04:00,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:04:00,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:04:00,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:04:00,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:04:00,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:04:00,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:04:00,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:04:00,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:04:00,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:04:00,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:04:00,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:04:00,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:04:00,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:04:00,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:04:00,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:04:00,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:04:00,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:04:00,302 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-11 15:04:00,325 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:04:00,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:04:00,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:04:00,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:04:00,326 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:04:00,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:04:00,327 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:04:00,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:04:00,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:04:00,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:04:00,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:04:00,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:04:00,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:04:00,328 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:04:00,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:04:00,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:04:00,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:04:00,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:04:00,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:04:00,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:04:00,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:04:00,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:04:00,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:04:00,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:04:00,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:04:00,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:04:00,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:04:00,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:04:00,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:04:00,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:04:00,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:04:00,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:04:00,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:04:00,664 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:04:00,664 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:04:00,665 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-10-11 15:04:00,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559540b82/f2cd3b070c3e457b98c08cf34fb8db57/FLAG78cff550b [2020-10-11 15:04:01,291 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:04:01,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-10-11 15:04:01,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559540b82/f2cd3b070c3e457b98c08cf34fb8db57/FLAG78cff550b [2020-10-11 15:04:01,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559540b82/f2cd3b070c3e457b98c08cf34fb8db57 [2020-10-11 15:04:01,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:04:01,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:04:01,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:04:01,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:04:01,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:04:01,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:01" (1/1) ... [2020-10-11 15:04:01,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1467314f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:01, skipping insertion in model container [2020-10-11 15:04:01,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:01" (1/1) ... [2020-10-11 15:04:01,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:04:01,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:04:02,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:04:02,179 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:04:02,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:04:02,315 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:04:02,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02 WrapperNode [2020-10-11 15:04:02,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:04:02,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:04:02,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:04:02,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:04:02,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:04:02,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:04:02,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:04:02,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:04:02,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (1/1) ... [2020-10-11 15:04:02,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:04:02,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:04:02,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:04:02,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:04:02,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (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-11 15:04:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:04:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 15:04:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:04:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:04:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 15:04:02,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 15:04:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 15:04:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 15:04:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 15:04:02,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 15:04:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 15:04:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:04:02,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:04:02,510 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:04:04,817 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:04:04,817 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 15:04:04,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:04 BoogieIcfgContainer [2020-10-11 15:04:04,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:04:04,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:04:04,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:04:04,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:04:04,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:04:01" (1/3) ... [2020-10-11 15:04:04,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d429099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:04, skipping insertion in model container [2020-10-11 15:04:04,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:02" (2/3) ... [2020-10-11 15:04:04,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d429099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:04, skipping insertion in model container [2020-10-11 15:04:04,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:04" (3/3) ... [2020-10-11 15:04:04,830 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2020-10-11 15:04:04,844 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:04:04,845 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:04:04,854 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 15:04:04,855 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:04:04,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,890 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,891 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,895 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,895 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,899 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,899 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,909 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,910 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,914 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,915 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,915 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,918 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,919 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:04:04,942 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 15:04:04,967 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:04:04,967 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:04:04,967 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:04:04,968 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:04:04,968 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:04:04,968 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:04:04,968 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:04:04,968 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:04:04,985 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:04:04,988 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-11 15:04:04,991 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-11 15:04:04,993 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 15:04:05,040 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-11 15:04:05,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 15:04:05,045 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 15:04:05,049 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-11 15:04:05,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 15:04:05,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:04:05,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:05,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:04:05,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:05,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:04:05,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:05,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:04:05,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:05,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:05,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:05,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:05,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:05,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:05,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:06,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:04:06,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:06,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:04:06,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:06,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:06,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:06,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:06,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:06,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:06,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:06,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:06,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:06,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:06,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:06,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:06,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:06,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:06,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:04:06,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:04:06,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:04:06,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:04:06,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:04:06,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:04:06,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:04:06,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:04:06,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:06,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:06,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-11 15:04:06,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:04:06,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:04:06,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:07,759 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-11 15:04:07,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-11 15:04:07,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:07,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:04:07,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:08,671 WARN L193 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-11 15:04:08,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 15:04:08,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,107 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-11 15:04:09,602 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 15:04:09,704 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 15:04:09,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 15:04:09,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:09,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:09,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:09,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:09,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:10,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:10,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:04:10,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:04:10,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:04:10,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:10,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:04:10,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:04:10,683 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-11 15:04:10,890 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-11 15:04:10,995 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-11 15:04:11,004 INFO L132 LiptonReduction]: Checked pairs total: 4811 [2020-10-11 15:04:11,004 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-11 15:04:11,011 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-11 15:04:11,070 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-11 15:04:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-11 15:04:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:04:11,078 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:11,079 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:04:11,080 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1041180, now seen corresponding path program 1 times [2020-10-11 15:04:11,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:11,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365082864] [2020-10-11 15:04:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:11,306 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-11 15:04:11,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365082864] [2020-10-11 15:04:11,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:11,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:04:11,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296862461] [2020-10-11 15:04:11,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:04:11,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:04:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:04:11,332 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-11 15:04:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:11,431 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-11 15:04:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:04:11,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:04:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:11,458 INFO L225 Difference]: With dead ends: 812 [2020-10-11 15:04:11,458 INFO L226 Difference]: Without dead ends: 687 [2020-10-11 15:04:11,460 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:04:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-11 15:04:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-11 15:04:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-11 15:04:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-11 15:04:11,601 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-11 15:04:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:11,601 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-11 15:04:11,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:04:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-11 15:04:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-11 15:04:11,605 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:11,606 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:11,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:04:11,606 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 626468161, now seen corresponding path program 1 times [2020-10-11 15:04:11,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:11,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916713683] [2020-10-11 15:04:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:11,791 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-11 15:04:11,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916713683] [2020-10-11 15:04:11,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:11,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:04:11,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132183785] [2020-10-11 15:04:11,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:04:11,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:11,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:04:11,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:04:11,794 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-11 15:04:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:11,853 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-10-11 15:04:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:04:11,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-11 15:04:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:11,861 INFO L225 Difference]: With dead ends: 792 [2020-10-11 15:04:11,861 INFO L226 Difference]: Without dead ends: 667 [2020-10-11 15:04:11,862 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-10-11 15:04:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-10-11 15:04:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-11 15:04:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-10-11 15:04:11,893 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-10-11 15:04:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:11,894 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-10-11 15:04:11,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:04:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-10-11 15:04:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 15:04:11,897 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:11,897 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:11,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:04:11,897 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 254166472, now seen corresponding path program 1 times [2020-10-11 15:04:11,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:11,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974974437] [2020-10-11 15:04:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:12,020 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-11 15:04:12,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974974437] [2020-10-11 15:04:12,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:12,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:04:12,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746397879] [2020-10-11 15:04:12,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:04:12,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:04:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:04:12,022 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-10-11 15:04:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:12,104 INFO L93 Difference]: Finished difference Result 759 states and 2283 transitions. [2020-10-11 15:04:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:04:12,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-11 15:04:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:12,110 INFO L225 Difference]: With dead ends: 759 [2020-10-11 15:04:12,111 INFO L226 Difference]: Without dead ends: 659 [2020-10-11 15:04:12,111 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-11 15:04:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-10-11 15:04:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-11 15:04:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 2044 transitions. [2020-10-11 15:04:12,134 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 2044 transitions. Word has length 11 [2020-10-11 15:04:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:12,134 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 2044 transitions. [2020-10-11 15:04:12,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:04:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 2044 transitions. [2020-10-11 15:04:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 15:04:12,137 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:12,137 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:12,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:04:12,138 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash -731543524, now seen corresponding path program 1 times [2020-10-11 15:04:12,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:12,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998818622] [2020-10-11 15:04:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:12,253 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-11 15:04:12,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998818622] [2020-10-11 15:04:12,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:12,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:04:12,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168065168] [2020-10-11 15:04:12,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:04:12,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:04:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:12,257 INFO L87 Difference]: Start difference. First operand 659 states and 2044 transitions. Second operand 5 states. [2020-10-11 15:04:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:12,444 INFO L93 Difference]: Finished difference Result 767 states and 2325 transitions. [2020-10-11 15:04:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:12,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-11 15:04:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:12,453 INFO L225 Difference]: With dead ends: 767 [2020-10-11 15:04:12,453 INFO L226 Difference]: Without dead ends: 687 [2020-10-11 15:04:12,454 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:04:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-11 15:04:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-11 15:04:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-11 15:04:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2125 transitions. [2020-10-11 15:04:12,490 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2125 transitions. Word has length 12 [2020-10-11 15:04:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:12,490 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2125 transitions. [2020-10-11 15:04:12,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:04:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2125 transitions. [2020-10-11 15:04:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 15:04:12,499 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:12,499 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:12,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:04:12,500 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash -710778236, now seen corresponding path program 1 times [2020-10-11 15:04:12,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:12,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334006342] [2020-10-11 15:04:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:12,619 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-11 15:04:12,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334006342] [2020-10-11 15:04:12,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:12,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:04:12,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998507349] [2020-10-11 15:04:12,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:04:12,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:04:12,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:04:12,624 INFO L87 Difference]: Start difference. First operand 687 states and 2125 transitions. Second operand 4 states. [2020-10-11 15:04:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:12,657 INFO L93 Difference]: Finished difference Result 744 states and 2231 transitions. [2020-10-11 15:04:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:04:12,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-11 15:04:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:12,664 INFO L225 Difference]: With dead ends: 744 [2020-10-11 15:04:12,664 INFO L226 Difference]: Without dead ends: 649 [2020-10-11 15:04:12,664 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-10-11 15:04:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2020-10-11 15:04:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-10-11 15:04:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1991 transitions. [2020-10-11 15:04:12,691 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1991 transitions. Word has length 12 [2020-10-11 15:04:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:12,691 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 1991 transitions. [2020-10-11 15:04:12,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:04:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1991 transitions. [2020-10-11 15:04:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:04:12,693 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:12,693 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:12,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:04:12,694 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1394966630, now seen corresponding path program 1 times [2020-10-11 15:04:12,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:12,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380131018] [2020-10-11 15:04:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:12,834 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-11 15:04:12,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380131018] [2020-10-11 15:04:12,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:12,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:04:12,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020164020] [2020-10-11 15:04:12,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:04:12,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:04:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:12,837 INFO L87 Difference]: Start difference. First operand 649 states and 1991 transitions. Second operand 5 states. [2020-10-11 15:04:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:12,933 INFO L93 Difference]: Finished difference Result 703 states and 2105 transitions. [2020-10-11 15:04:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:04:12,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:04:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:12,939 INFO L225 Difference]: With dead ends: 703 [2020-10-11 15:04:12,939 INFO L226 Difference]: Without dead ends: 643 [2020-10-11 15:04:12,939 INFO L673 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-11 15:04:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-10-11 15:04:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2020-10-11 15:04:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-10-11 15:04:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1969 transitions. [2020-10-11 15:04:12,964 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1969 transitions. Word has length 13 [2020-10-11 15:04:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:12,965 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 1969 transitions. [2020-10-11 15:04:12,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:04:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1969 transitions. [2020-10-11 15:04:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:04:12,966 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:12,967 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:12,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:04:12,967 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1203017040, now seen corresponding path program 1 times [2020-10-11 15:04:12,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:12,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025794847] [2020-10-11 15:04:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:13,065 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-11 15:04:13,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025794847] [2020-10-11 15:04:13,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:13,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:04:13,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811765012] [2020-10-11 15:04:13,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:04:13,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:04:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:13,067 INFO L87 Difference]: Start difference. First operand 643 states and 1969 transitions. Second operand 5 states. [2020-10-11 15:04:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:13,110 INFO L93 Difference]: Finished difference Result 807 states and 2432 transitions. [2020-10-11 15:04:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:13,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:04:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:13,114 INFO L225 Difference]: With dead ends: 807 [2020-10-11 15:04:13,114 INFO L226 Difference]: Without dead ends: 431 [2020-10-11 15:04:13,115 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:04:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-11 15:04:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-10-11 15:04:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-10-11 15:04:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2020-10-11 15:04:13,128 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2020-10-11 15:04:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:13,129 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2020-10-11 15:04:13,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:04:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2020-10-11 15:04:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:04:13,130 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:13,130 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:13,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:04:13,130 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 244893855, now seen corresponding path program 1 times [2020-10-11 15:04:13,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:13,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769721053] [2020-10-11 15:04:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:13,207 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-11 15:04:13,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769721053] [2020-10-11 15:04:13,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:13,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:04:13,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367763173] [2020-10-11 15:04:13,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:04:13,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:04:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:04:13,209 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states. [2020-10-11 15:04:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:13,324 INFO L93 Difference]: Finished difference Result 465 states and 1318 transitions. [2020-10-11 15:04:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:13,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-11 15:04:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:13,328 INFO L225 Difference]: With dead ends: 465 [2020-10-11 15:04:13,329 INFO L226 Difference]: Without dead ends: 420 [2020-10-11 15:04:13,329 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-11 15:04:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 413. [2020-10-11 15:04:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-11 15:04:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1188 transitions. [2020-10-11 15:04:13,341 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1188 transitions. Word has length 14 [2020-10-11 15:04:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:13,341 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 1188 transitions. [2020-10-11 15:04:13,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:04:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1188 transitions. [2020-10-11 15:04:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:04:13,342 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:13,342 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:13,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:04:13,343 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash 294288294, now seen corresponding path program 1 times [2020-10-11 15:04:13,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:13,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971062587] [2020-10-11 15:04:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:13,469 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-11 15:04:13,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971062587] [2020-10-11 15:04:13,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:13,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:04:13,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098339699] [2020-10-11 15:04:13,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:04:13,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:04:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:04:13,472 INFO L87 Difference]: Start difference. First operand 413 states and 1188 transitions. Second operand 6 states. [2020-10-11 15:04:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:13,576 INFO L93 Difference]: Finished difference Result 493 states and 1388 transitions. [2020-10-11 15:04:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:13,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-11 15:04:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:13,585 INFO L225 Difference]: With dead ends: 493 [2020-10-11 15:04:13,585 INFO L226 Difference]: Without dead ends: 441 [2020-10-11 15:04:13,586 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-11 15:04:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-10-11 15:04:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-11 15:04:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1268 transitions. [2020-10-11 15:04:13,604 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1268 transitions. Word has length 14 [2020-10-11 15:04:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:13,605 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1268 transitions. [2020-10-11 15:04:13,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:04:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1268 transitions. [2020-10-11 15:04:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:04:13,606 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:13,606 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:13,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:04:13,607 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -998229363, now seen corresponding path program 1 times [2020-10-11 15:04:13,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:13,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798903604] [2020-10-11 15:04:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:13,815 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-11 15:04:13,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798903604] [2020-10-11 15:04:13,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:13,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:04:13,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305453559] [2020-10-11 15:04:13,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:04:13,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:04:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:13,817 INFO L87 Difference]: Start difference. First operand 441 states and 1268 transitions. Second operand 7 states. [2020-10-11 15:04:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:14,028 INFO L93 Difference]: Finished difference Result 544 states and 1543 transitions. [2020-10-11 15:04:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:14,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:04:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:14,033 INFO L225 Difference]: With dead ends: 544 [2020-10-11 15:04:14,033 INFO L226 Difference]: Without dead ends: 492 [2020-10-11 15:04:14,034 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:04:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-11 15:04:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485. [2020-10-11 15:04:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-11 15:04:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions. [2020-10-11 15:04:14,048 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 15 [2020-10-11 15:04:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:14,048 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions. [2020-10-11 15:04:14,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:04:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions. [2020-10-11 15:04:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:04:14,050 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:14,050 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:14,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:04:14,050 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash 532955001, now seen corresponding path program 1 times [2020-10-11 15:04:14,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:14,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920273860] [2020-10-11 15:04:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:14,258 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-11 15:04:14,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920273860] [2020-10-11 15:04:14,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:14,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:04:14,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738287258] [2020-10-11 15:04:14,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:04:14,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:04:14,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:14,260 INFO L87 Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 7 states. [2020-10-11 15:04:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:14,449 INFO L93 Difference]: Finished difference Result 509 states and 1432 transitions. [2020-10-11 15:04:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:14,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:04:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:14,453 INFO L225 Difference]: With dead ends: 509 [2020-10-11 15:04:14,454 INFO L226 Difference]: Without dead ends: 477 [2020-10-11 15:04:14,454 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:04:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-11 15:04:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-10-11 15:04:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-10-11 15:04:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions. [2020-10-11 15:04:14,468 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15 [2020-10-11 15:04:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:14,468 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions. [2020-10-11 15:04:14,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:04:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions. [2020-10-11 15:04:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 15:04:14,470 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:14,470 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:14,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:04:14,471 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash -880386702, now seen corresponding path program 1 times [2020-10-11 15:04:14,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:14,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442250933] [2020-10-11 15:04:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:14,800 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-11 15:04:14,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442250933] [2020-10-11 15:04:14,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:14,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:04:14,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220344152] [2020-10-11 15:04:14,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:04:14,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:14,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:04:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:04:14,803 INFO L87 Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 8 states. [2020-10-11 15:04:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:15,102 INFO L93 Difference]: Finished difference Result 525 states and 1474 transitions. [2020-10-11 15:04:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:15,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-11 15:04:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:15,106 INFO L225 Difference]: With dead ends: 525 [2020-10-11 15:04:15,106 INFO L226 Difference]: Without dead ends: 493 [2020-10-11 15:04:15,107 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:04:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-10-11 15:04:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 425. [2020-10-11 15:04:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-10-11 15:04:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1202 transitions. [2020-10-11 15:04:15,119 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1202 transitions. Word has length 16 [2020-10-11 15:04:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:15,119 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 1202 transitions. [2020-10-11 15:04:15,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:04:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1202 transitions. [2020-10-11 15:04:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 15:04:15,121 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:15,121 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:15,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:04:15,121 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -880379975, now seen corresponding path program 1 times [2020-10-11 15:04:15,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:15,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956028137] [2020-10-11 15:04:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:04:15,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956028137] [2020-10-11 15:04:15,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:15,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:04:15,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244408104] [2020-10-11 15:04:15,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:04:15,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:04:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:04:15,369 INFO L87 Difference]: Start difference. First operand 425 states and 1202 transitions. Second operand 8 states. [2020-10-11 15:04:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:15,642 INFO L93 Difference]: Finished difference Result 548 states and 1532 transitions. [2020-10-11 15:04:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:15,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-11 15:04:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:15,646 INFO L225 Difference]: With dead ends: 548 [2020-10-11 15:04:15,647 INFO L226 Difference]: Without dead ends: 516 [2020-10-11 15:04:15,647 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 15:04:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-10-11 15:04:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 461. [2020-10-11 15:04:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-10-11 15:04:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1308 transitions. [2020-10-11 15:04:15,663 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1308 transitions. Word has length 16 [2020-10-11 15:04:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:15,664 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 1308 transitions. [2020-10-11 15:04:15,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:04:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1308 transitions. [2020-10-11 15:04:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 15:04:15,666 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:15,666 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:15,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:04:15,666 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash -658556729, now seen corresponding path program 1 times [2020-10-11 15:04:15,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:15,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383341249] [2020-10-11 15:04:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:15,769 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-11 15:04:15,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383341249] [2020-10-11 15:04:15,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:15,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:04:15,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377306660] [2020-10-11 15:04:15,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:04:15,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:04:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:04:15,771 INFO L87 Difference]: Start difference. First operand 461 states and 1308 transitions. Second operand 6 states. [2020-10-11 15:04:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:15,918 INFO L93 Difference]: Finished difference Result 665 states and 1850 transitions. [2020-10-11 15:04:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:15,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-11 15:04:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:15,923 INFO L225 Difference]: With dead ends: 665 [2020-10-11 15:04:15,923 INFO L226 Difference]: Without dead ends: 517 [2020-10-11 15:04:15,923 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-11 15:04:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 510. [2020-10-11 15:04:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-10-11 15:04:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1394 transitions. [2020-10-11 15:04:15,936 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1394 transitions. Word has length 16 [2020-10-11 15:04:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:15,936 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 1394 transitions. [2020-10-11 15:04:15,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:04:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1394 transitions. [2020-10-11 15:04:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 15:04:15,938 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:15,938 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:15,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 15:04:15,938 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1563905219, now seen corresponding path program 2 times [2020-10-11 15:04:15,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:15,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642338418] [2020-10-11 15:04:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:04:16,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642338418] [2020-10-11 15:04:16,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:16,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:04:16,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926974226] [2020-10-11 15:04:16,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:04:16,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:04:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:16,136 INFO L87 Difference]: Start difference. First operand 510 states and 1394 transitions. Second operand 7 states. [2020-10-11 15:04:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:16,303 INFO L93 Difference]: Finished difference Result 678 states and 1838 transitions. [2020-10-11 15:04:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:16,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-11 15:04:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:16,307 INFO L225 Difference]: With dead ends: 678 [2020-10-11 15:04:16,307 INFO L226 Difference]: Without dead ends: 506 [2020-10-11 15:04:16,309 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:04:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-10-11 15:04:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 500. [2020-10-11 15:04:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-11 15:04:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1357 transitions. [2020-10-11 15:04:16,322 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1357 transitions. Word has length 16 [2020-10-11 15:04:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:16,322 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1357 transitions. [2020-10-11 15:04:16,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:04:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1357 transitions. [2020-10-11 15:04:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 15:04:16,326 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:16,326 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:16,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 15:04:16,326 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1070278051, now seen corresponding path program 3 times [2020-10-11 15:04:16,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:16,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494948958] [2020-10-11 15:04:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:16,384 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-11 15:04:16,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494948958] [2020-10-11 15:04:16,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:16,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:04:16,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233523996] [2020-10-11 15:04:16,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:04:16,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:04:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:04:16,386 INFO L87 Difference]: Start difference. First operand 500 states and 1357 transitions. Second operand 4 states. [2020-10-11 15:04:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:16,414 INFO L93 Difference]: Finished difference Result 483 states and 1172 transitions. [2020-10-11 15:04:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:04:16,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-11 15:04:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:16,417 INFO L225 Difference]: With dead ends: 483 [2020-10-11 15:04:16,417 INFO L226 Difference]: Without dead ends: 365 [2020-10-11 15:04:16,417 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-10-11 15:04:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2020-10-11 15:04:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-10-11 15:04:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 872 transitions. [2020-10-11 15:04:16,425 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 872 transitions. Word has length 16 [2020-10-11 15:04:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:16,425 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 872 transitions. [2020-10-11 15:04:16,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:04:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 872 transitions. [2020-10-11 15:04:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:04:16,427 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:16,427 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:16,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 15:04:16,427 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash -55478072, now seen corresponding path program 1 times [2020-10-11 15:04:16,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:16,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875579349] [2020-10-11 15:04:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:16,481 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-11 15:04:16,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875579349] [2020-10-11 15:04:16,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:16,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:04:16,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231229413] [2020-10-11 15:04:16,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:04:16,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:04:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:04:16,483 INFO L87 Difference]: Start difference. First operand 365 states and 872 transitions. Second operand 5 states. [2020-10-11 15:04:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:16,523 INFO L93 Difference]: Finished difference Result 298 states and 651 transitions. [2020-10-11 15:04:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:16,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:04:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:16,526 INFO L225 Difference]: With dead ends: 298 [2020-10-11 15:04:16,526 INFO L226 Difference]: Without dead ends: 233 [2020-10-11 15:04:16,527 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:04:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-10-11 15:04:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2020-10-11 15:04:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-11 15:04:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 496 transitions. [2020-10-11 15:04:16,532 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 496 transitions. Word has length 17 [2020-10-11 15:04:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:16,532 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 496 transitions. [2020-10-11 15:04:16,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:04:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 496 transitions. [2020-10-11 15:04:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:04:16,534 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:16,534 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:16,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 15:04:16,534 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -952257862, now seen corresponding path program 1 times [2020-10-11 15:04:16,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:16,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837696705] [2020-10-11 15:04:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:16,972 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-11 15:04:16,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837696705] [2020-10-11 15:04:16,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:16,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:04:16,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908152410] [2020-10-11 15:04:16,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:04:16,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:04:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:04:16,973 INFO L87 Difference]: Start difference. First operand 233 states and 496 transitions. Second operand 9 states. [2020-10-11 15:04:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:17,255 INFO L93 Difference]: Finished difference Result 275 states and 582 transitions. [2020-10-11 15:04:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:17,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:04:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:17,257 INFO L225 Difference]: With dead ends: 275 [2020-10-11 15:04:17,257 INFO L226 Difference]: Without dead ends: 271 [2020-10-11 15:04:17,258 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:04:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-11 15:04:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 243. [2020-10-11 15:04:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-11 15:04:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 521 transitions. [2020-10-11 15:04:17,263 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 521 transitions. Word has length 19 [2020-10-11 15:04:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:17,264 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 521 transitions. [2020-10-11 15:04:17,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:04:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 521 transitions. [2020-10-11 15:04:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:04:17,265 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:17,265 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:17,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 15:04:17,265 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash -323303904, now seen corresponding path program 2 times [2020-10-11 15:04:17,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:17,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490298433] [2020-10-11 15:04:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:17,590 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-11 15:04:17,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490298433] [2020-10-11 15:04:17,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:17,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:04:17,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372397361] [2020-10-11 15:04:17,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:04:17,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:04:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:04:17,592 INFO L87 Difference]: Start difference. First operand 243 states and 521 transitions. Second operand 9 states. [2020-10-11 15:04:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:17,974 INFO L93 Difference]: Finished difference Result 372 states and 758 transitions. [2020-10-11 15:04:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 15:04:17,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:04:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:17,976 INFO L225 Difference]: With dead ends: 372 [2020-10-11 15:04:17,976 INFO L226 Difference]: Without dead ends: 336 [2020-10-11 15:04:17,976 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:04:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-10-11 15:04:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 251. [2020-10-11 15:04:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-11 15:04:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 532 transitions. [2020-10-11 15:04:17,985 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 532 transitions. Word has length 19 [2020-10-11 15:04:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:17,985 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 532 transitions. [2020-10-11 15:04:17,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:04:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 532 transitions. [2020-10-11 15:04:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:04:17,987 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:17,987 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:17,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 15:04:17,987 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash -256873496, now seen corresponding path program 1 times [2020-10-11 15:04:17,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:17,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424856647] [2020-10-11 15:04:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:18,042 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-11 15:04:18,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424856647] [2020-10-11 15:04:18,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:18,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:04:18,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35139985] [2020-10-11 15:04:18,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:04:18,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:04:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:04:18,044 INFO L87 Difference]: Start difference. First operand 251 states and 532 transitions. Second operand 4 states. [2020-10-11 15:04:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:18,101 INFO L93 Difference]: Finished difference Result 339 states and 697 transitions. [2020-10-11 15:04:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:04:18,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-11 15:04:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:18,103 INFO L225 Difference]: With dead ends: 339 [2020-10-11 15:04:18,103 INFO L226 Difference]: Without dead ends: 182 [2020-10-11 15:04:18,104 INFO L673 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-11 15:04:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-11 15:04:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2020-10-11 15:04:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-11 15:04:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 350 transitions. [2020-10-11 15:04:18,109 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 350 transitions. Word has length 19 [2020-10-11 15:04:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:18,109 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 350 transitions. [2020-10-11 15:04:18,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:04:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 350 transitions. [2020-10-11 15:04:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:04:18,112 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:18,112 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:18,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 15:04:18,112 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1744897356, now seen corresponding path program 3 times [2020-10-11 15:04:18,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:18,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761075245] [2020-10-11 15:04:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:18,599 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-11 15:04:18,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761075245] [2020-10-11 15:04:18,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:18,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:04:18,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950916543] [2020-10-11 15:04:18,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:04:18,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:04:18,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:04:18,602 INFO L87 Difference]: Start difference. First operand 176 states and 350 transitions. Second operand 9 states. [2020-10-11 15:04:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:18,785 INFO L93 Difference]: Finished difference Result 209 states and 401 transitions. [2020-10-11 15:04:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:04:18,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:04:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:18,787 INFO L225 Difference]: With dead ends: 209 [2020-10-11 15:04:18,787 INFO L226 Difference]: Without dead ends: 145 [2020-10-11 15:04:18,788 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:04:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-11 15:04:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2020-10-11 15:04:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-11 15:04:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2020-10-11 15:04:18,791 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2020-10-11 15:04:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:18,793 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2020-10-11 15:04:18,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:04:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2020-10-11 15:04:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:04:18,793 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:18,794 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:18,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 15:04:18,794 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1136707252, now seen corresponding path program 2 times [2020-10-11 15:04:18,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:18,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561349897] [2020-10-11 15:04:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:04:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:04:18,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561349897] [2020-10-11 15:04:18,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:04:18,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:04:18,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57541534] [2020-10-11 15:04:18,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:04:18,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:04:18,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:04:18,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:04:18,890 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2020-10-11 15:04:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:04:18,940 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2020-10-11 15:04:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:04:18,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-11 15:04:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:04:18,941 INFO L225 Difference]: With dead ends: 112 [2020-10-11 15:04:18,942 INFO L226 Difference]: Without dead ends: 63 [2020-10-11 15:04:18,942 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:04:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-11 15:04:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-11 15:04:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-11 15:04:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-11 15:04:18,945 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-11 15:04:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:04:18,946 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-11 15:04:18,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:04:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-11 15:04:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:04:18,946 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:04:18,947 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:04:18,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 15:04:18,948 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:04:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:04:18,948 INFO L82 PathProgramCache]: Analyzing trace with hash -898304440, now seen corresponding path program 1 times [2020-10-11 15:04:18,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:04:18,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053383363] [2020-10-11 15:04:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:04:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:04:18,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:04:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:04:19,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:04:19,059 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:04:19,060 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:04:19,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 15:04:19,078 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-11 15:04:19,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,080 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-11 15:04:19,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,080 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-11 15:04:19,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,080 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-11 15:04:19,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,081 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-11 15:04:19,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,081 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-11 15:04:19,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,082 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-11 15:04:19,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,082 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-11 15:04:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,083 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-11 15:04:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,083 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-11 15:04:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,083 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-11 15:04:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,084 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-11 15:04:19,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,084 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-11 15:04:19,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,084 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-11 15:04:19,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,085 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-11 15:04:19,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,085 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-11 15:04:19,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,086 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-11 15:04:19,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,086 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-11 15:04:19,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,087 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-11 15:04:19,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,087 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-11 15:04:19,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,087 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-11 15:04:19,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,088 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-11 15:04:19,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,088 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-11 15:04:19,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,088 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-11 15:04:19,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,089 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-11 15:04:19,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,089 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-11 15:04:19,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,089 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-11 15:04:19,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,090 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-11 15:04:19,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,090 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-11 15:04:19,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,090 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-11 15:04:19,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,091 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-11 15:04:19,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,091 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-11 15:04:19,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,092 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-11 15:04:19,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,092 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-11 15:04:19,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,092 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-11 15:04:19,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,093 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-11 15:04:19,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:04:19,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:04:19 BasicIcfg [2020-10-11 15:04:19,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:04:19,154 INFO L168 Benchmark]: Toolchain (without parser) took 17578.25 ms. Allocated memory was 250.1 MB in the beginning and 582.5 MB in the end (delta: 332.4 MB). Free memory was 205.2 MB in the beginning and 386.7 MB in the end (delta: -181.5 MB). Peak memory consumption was 150.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:04:19,154 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:04:19,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.68 ms. Allocated memory was 250.1 MB in the beginning and 310.9 MB in the end (delta: 60.8 MB). Free memory was 205.2 MB in the beginning and 259.2 MB in the end (delta: -53.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. [2020-10-11 15:04:19,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.16 ms. Allocated memory is still 310.9 MB. Free memory was 259.2 MB in the beginning and 254.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 15:04:19,156 INFO L168 Benchmark]: Boogie Preprocessor took 41.27 ms. Allocated memory is still 310.9 MB. Free memory was 254.1 MB in the beginning and 251.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:04:19,156 INFO L168 Benchmark]: RCFGBuilder took 2397.17 ms. Allocated memory was 310.9 MB in the beginning and 356.5 MB in the end (delta: 45.6 MB). Free memory was 251.6 MB in the beginning and 178.7 MB in the end (delta: 72.9 MB). Peak memory consumption was 118.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:04:19,157 INFO L168 Benchmark]: TraceAbstraction took 14330.53 ms. Allocated memory was 356.5 MB in the beginning and 582.5 MB in the end (delta: 226.0 MB). Free memory was 178.7 MB in the beginning and 386.7 MB in the end (delta: -208.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:04:19,160 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 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 738.68 ms. Allocated memory was 250.1 MB in the beginning and 310.9 MB in the end (delta: 60.8 MB). Free memory was 205.2 MB in the beginning and 259.2 MB in the end (delta: -53.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.16 ms. Allocated memory is still 310.9 MB. Free memory was 259.2 MB in the beginning and 254.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.27 ms. Allocated memory is still 310.9 MB. Free memory was 254.1 MB in the beginning and 251.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2397.17 ms. Allocated memory was 310.9 MB in the beginning and 356.5 MB in the end (delta: 45.6 MB). Free memory was 251.6 MB in the beginning and 178.7 MB in the end (delta: 72.9 MB). Peak memory consumption was 118.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14330.53 ms. Allocated memory was 356.5 MB in the beginning and 582.5 MB in the end (delta: 226.0 MB). Free memory was 178.7 MB in the beginning and 386.7 MB in the end (delta: -208.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1045 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.0s, 100 PlacesBefore, 37 PlacesAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4811 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2031; [L808] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] 0 pthread_t t2032; [L810] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L811] 0 pthread_t t2033; [L812] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 2 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L782] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L785] 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) [L785] 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) [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 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 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 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 [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L818] 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) [L818] 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) [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 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 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 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 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 z$flush_delayed = weak$$choice2 [L828] 0 z$mem_tmp = z [L829] 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) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L829] 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) [L829] 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) [L830] 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)) [L830] 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) [L830] 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)) [L830] 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)) [L831] 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)) [L831] EXPR 0 !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) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L831] EXPR 0 !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) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] EXPR 0 !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) [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] EXPR 0 !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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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) [L835] 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)) [L835] 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)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L837] 0 z = z$flush_delayed ? z$mem_tmp : z [L838] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 645 SDtfs, 761 SDslu, 1560 SDs, 0 SdLazy, 933 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 283 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 55807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...