/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:02:53,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:02:53,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:02:53,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:02:53,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:02:53,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:02:53,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:02:53,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:02:53,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:02:53,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:02:53,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:02:53,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:02:53,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:02:53,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:02:53,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:02:53,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:02:53,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:02:53,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:02:53,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:02:53,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:02:53,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:02:53,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:02:53,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:02:53,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:02:53,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:02:53,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:02:53,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:02:53,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:02:53,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:02:53,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:02:53,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:02:53,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:02:53,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:02:53,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:02:53,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:02:53,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:02:53,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:02:53,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:02:53,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:02:53,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:02:53,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:02:53,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:02:53,433 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:02:53,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:02:53,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:02:53,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:02:53,435 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:02:53,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:02:53,436 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:02:53,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:02:53,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:02:53,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:02:53,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:02:53,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:02:53,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:02:53,438 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:02:53,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:02:53,439 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:02:53,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:02:53,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:02:53,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:02:53,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:02:53,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:02:53,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:02:53,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:02:53,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:02:53,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:02:53,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:02:53,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:02:53,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:02:53,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:02:53,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:02:53,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:02:53,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:02:53,742 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:02:53,742 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:02:53,743 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-10-15 22:02:53,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd20728c3/4807bc367f7d4f949290d2ff325293ff/FLAGe07fe63fd [2020-10-15 22:02:54,334 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:02:54,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-10-15 22:02:54,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd20728c3/4807bc367f7d4f949290d2ff325293ff/FLAGe07fe63fd [2020-10-15 22:02:54,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd20728c3/4807bc367f7d4f949290d2ff325293ff [2020-10-15 22:02:54,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:02:54,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:02:54,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:02:54,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:02:54,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:02:54,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:02:54" (1/1) ... [2020-10-15 22:02:54,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a6e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:54, skipping insertion in model container [2020-10-15 22:02:54,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:02:54" (1/1) ... [2020-10-15 22:02:54,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:02:54,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:02:55,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:02:55,336 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:02:55,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:02:55,473 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:02:55,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55 WrapperNode [2020-10-15 22:02:55,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:02:55,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:02:55,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:02:55,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:02:55,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:02:55,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:02:55,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:02:55,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:02:55,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... [2020-10-15 22:02:55,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:02:55,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:02:55,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:02:55,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:02:55,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:02:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:02:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:02:55,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:02:55,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:02:55,743 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:02:55,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:02:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:02:55,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:02:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:02:55,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:02:55,751 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 22:02:55,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 22:02:55,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:02:55,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:02:55,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:02:55,754 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:02:57,727 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:02:57,728 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:02:57,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:02:57 BoogieIcfgContainer [2020-10-15 22:02:57,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:02:57,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:02:57,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:02:57,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:02:57,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:02:54" (1/3) ... [2020-10-15 22:02:57,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f367c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:02:57, skipping insertion in model container [2020-10-15 22:02:57,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:55" (2/3) ... [2020-10-15 22:02:57,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f367c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:02:57, skipping insertion in model container [2020-10-15 22:02:57,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:02:57" (3/3) ... [2020-10-15 22:02:57,740 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2020-10-15 22:02:57,754 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:02:57,754 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:02:57,764 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:02:57,765 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:02:57,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,802 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,802 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,806 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,806 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,806 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,807 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,815 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,821 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,822 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,823 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,824 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,825 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,826 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:57,841 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 22:02:57,862 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:02:57,863 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:02:57,863 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:02:57,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:02:57,863 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:02:57,863 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:02:57,863 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:02:57,864 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:02:57,878 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:02:57,881 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-15 22:02:57,885 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-15 22:02:57,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-15 22:02:57,940 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-15 22:02:57,940 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:02:57,946 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-15 22:02:57,951 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-15 22:02:58,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:58,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:58,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:58,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:58,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:58,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:58,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:58,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:58,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:58,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:58,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:58,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:58,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:58,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:58,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:58,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:58,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:02:58,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:58,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:02:58,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:58,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:02:58,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:58,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:02:58,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:59,596 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-15 22:02:59,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-15 22:02:59,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:59,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:02:59,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:00,795 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-15 22:03:00,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:03:00,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:00,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:00,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:00,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:00,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:00,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:00,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:00,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:00,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:00,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:00,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:00,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:00,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:00,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:00,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:00,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:00,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:01,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:01,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:01,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:01,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:01,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:01,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:01,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:01,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:01,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:01,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:01,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:01,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:01,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:01,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:01,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:01,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:01,483 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 22:03:01,917 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 22:03:02,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:02,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:02,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:02,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:02,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:02,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:02,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:02,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:02,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:03,637 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-15 22:03:04,076 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-15 22:03:04,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:04,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:04,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:04,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:04,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:04,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:04,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:04,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:04,541 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-15 22:03:04,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:03:04,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:05,980 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-15 22:03:06,318 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-15 22:03:07,187 WARN L193 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-15 22:03:07,543 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-15 22:03:07,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:03:07,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:07,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:07,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 22:03:07,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:07,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 22:03:07,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:07,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:03:07,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 22:03:07,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:08,932 WARN L193 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-10-15 22:03:09,259 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-15 22:03:09,621 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-15 22:03:09,756 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 22:03:09,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:09,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:09,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:09,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:09,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:09,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:03:09,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:03:09,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:03:09,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:09,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:03:09,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:03:09,923 INFO L132 LiptonReduction]: Checked pairs total: 5626 [2020-10-15 22:03:09,923 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-15 22:03:09,930 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-15 22:03:10,105 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-15 22:03:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-15 22:03:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 22:03:10,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:10,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:10,124 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-15 22:03:10,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:10,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663700265] [2020-10-15 22:03:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:10,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663700265] [2020-10-15 22:03:10,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:10,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:03:10,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730587555] [2020-10-15 22:03:10,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:10,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:10,485 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-15 22:03:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:10,648 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-15 22:03:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:10,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 22:03:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:10,689 INFO L225 Difference]: With dead ends: 2202 [2020-10-15 22:03:10,690 INFO L226 Difference]: Without dead ends: 1802 [2020-10-15 22:03:10,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-15 22:03:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-15 22:03:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-15 22:03:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-15 22:03:10,909 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-15 22:03:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:10,910 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-15 22:03:10,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-15 22:03:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:03:10,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:10,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:10,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:03:10,915 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 440307530, now seen corresponding path program 1 times [2020-10-15 22:03:10,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:10,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543887456] [2020-10-15 22:03:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:11,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543887456] [2020-10-15 22:03:11,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:11,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:03:11,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138851628] [2020-10-15 22:03:11,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:11,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:11,025 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-15 22:03:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:11,061 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-15 22:03:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:11,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 22:03:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:11,078 INFO L225 Difference]: With dead ends: 1762 [2020-10-15 22:03:11,078 INFO L226 Difference]: Without dead ends: 1762 [2020-10-15 22:03:11,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-15 22:03:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-15 22:03:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-15 22:03:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-15 22:03:11,153 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-15 22:03:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:11,153 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-15 22:03:11,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-15 22:03:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:03:11,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:11,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:11,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:03:11,161 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 249955351, now seen corresponding path program 1 times [2020-10-15 22:03:11,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:11,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119773350] [2020-10-15 22:03:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:11,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119773350] [2020-10-15 22:03:11,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:11,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:03:11,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129198472] [2020-10-15 22:03:11,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:11,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:11,263 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-15 22:03:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:11,310 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-10-15 22:03:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:11,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 22:03:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:11,325 INFO L225 Difference]: With dead ends: 1754 [2020-10-15 22:03:11,325 INFO L226 Difference]: Without dead ends: 1754 [2020-10-15 22:03:11,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-10-15 22:03:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-10-15 22:03:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-10-15 22:03:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-10-15 22:03:11,381 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-10-15 22:03:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:11,382 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-10-15 22:03:11,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-10-15 22:03:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:03:11,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:11,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:11,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:03:11,384 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:11,384 INFO L82 PathProgramCache]: Analyzing trace with hash -840938303, now seen corresponding path program 1 times [2020-10-15 22:03:11,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:11,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565905690] [2020-10-15 22:03:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:11,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565905690] [2020-10-15 22:03:11,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:11,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:03:11,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397543957] [2020-10-15 22:03:11,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:03:11,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:03:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:03:11,507 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 4 states. [2020-10-15 22:03:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:11,592 INFO L93 Difference]: Finished difference Result 1732 states and 6468 transitions. [2020-10-15 22:03:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:11,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 22:03:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:11,611 INFO L225 Difference]: With dead ends: 1732 [2020-10-15 22:03:11,612 INFO L226 Difference]: Without dead ends: 1732 [2020-10-15 22:03:11,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:03:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2020-10-15 22:03:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2020-10-15 22:03:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-10-15 22:03:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 6468 transitions. [2020-10-15 22:03:11,694 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 6468 transitions. Word has length 13 [2020-10-15 22:03:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:11,694 INFO L481 AbstractCegarLoop]: Abstraction has 1732 states and 6468 transitions. [2020-10-15 22:03:11,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:03:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 6468 transitions. [2020-10-15 22:03:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:03:11,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:11,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:11,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:03:11,698 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash -840461647, now seen corresponding path program 1 times [2020-10-15 22:03:11,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:11,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958095870] [2020-10-15 22:03:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:11,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958095870] [2020-10-15 22:03:11,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:11,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:03:11,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083667301] [2020-10-15 22:03:11,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:11,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:11,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:11,799 INFO L87 Difference]: Start difference. First operand 1732 states and 6468 transitions. Second operand 3 states. [2020-10-15 22:03:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:11,827 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-15 22:03:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:11,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 22:03:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:11,842 INFO L225 Difference]: With dead ends: 1700 [2020-10-15 22:03:11,842 INFO L226 Difference]: Without dead ends: 1700 [2020-10-15 22:03:11,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-15 22:03:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-15 22:03:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-15 22:03:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-15 22:03:11,911 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 13 [2020-10-15 22:03:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:11,911 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-15 22:03:11,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-15 22:03:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:03:11,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:11,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:11,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:03:11,914 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -333997007, now seen corresponding path program 1 times [2020-10-15 22:03:11,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:11,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125886547] [2020-10-15 22:03:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:12,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125886547] [2020-10-15 22:03:12,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:12,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:12,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673541278] [2020-10-15 22:03:12,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:12,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:12,075 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 5 states. [2020-10-15 22:03:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:12,210 INFO L93 Difference]: Finished difference Result 1674 states and 6208 transitions. [2020-10-15 22:03:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:12,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 22:03:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:12,226 INFO L225 Difference]: With dead ends: 1674 [2020-10-15 22:03:12,226 INFO L226 Difference]: Without dead ends: 1674 [2020-10-15 22:03:12,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-10-15 22:03:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1658. [2020-10-15 22:03:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-10-15 22:03:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 6152 transitions. [2020-10-15 22:03:12,282 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 6152 transitions. Word has length 14 [2020-10-15 22:03:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:12,282 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 6152 transitions. [2020-10-15 22:03:12,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 6152 transitions. [2020-10-15 22:03:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:03:12,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:12,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:12,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:03:12,285 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash -298426553, now seen corresponding path program 1 times [2020-10-15 22:03:12,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:12,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602849540] [2020-10-15 22:03:12,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:12,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602849540] [2020-10-15 22:03:12,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:12,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:12,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510713006] [2020-10-15 22:03:12,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:12,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:12,390 INFO L87 Difference]: Start difference. First operand 1658 states and 6152 transitions. Second operand 5 states. [2020-10-15 22:03:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:12,460 INFO L93 Difference]: Finished difference Result 1614 states and 5960 transitions. [2020-10-15 22:03:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:12,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 22:03:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:12,474 INFO L225 Difference]: With dead ends: 1614 [2020-10-15 22:03:12,474 INFO L226 Difference]: Without dead ends: 1614 [2020-10-15 22:03:12,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2020-10-15 22:03:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2020-10-15 22:03:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-15 22:03:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5960 transitions. [2020-10-15 22:03:12,528 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5960 transitions. Word has length 14 [2020-10-15 22:03:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:12,528 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 5960 transitions. [2020-10-15 22:03:12,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5960 transitions. [2020-10-15 22:03:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:03:12,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:12,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:12,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:03:12,531 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:12,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1763115561, now seen corresponding path program 1 times [2020-10-15 22:03:12,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:12,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68554739] [2020-10-15 22:03:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:12,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68554739] [2020-10-15 22:03:12,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:12,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:03:12,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161285817] [2020-10-15 22:03:12,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:03:12,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:03:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:12,727 INFO L87 Difference]: Start difference. First operand 1614 states and 5960 transitions. Second operand 6 states. [2020-10-15 22:03:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:12,810 INFO L93 Difference]: Finished difference Result 1726 states and 6416 transitions. [2020-10-15 22:03:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:12,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 22:03:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:12,826 INFO L225 Difference]: With dead ends: 1726 [2020-10-15 22:03:12,826 INFO L226 Difference]: Without dead ends: 1726 [2020-10-15 22:03:12,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2020-10-15 22:03:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2020-10-15 22:03:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2020-10-15 22:03:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 6416 transitions. [2020-10-15 22:03:12,942 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 6416 transitions. Word has length 15 [2020-10-15 22:03:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:12,942 INFO L481 AbstractCegarLoop]: Abstraction has 1726 states and 6416 transitions. [2020-10-15 22:03:12,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:03:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 6416 transitions. [2020-10-15 22:03:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:03:12,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:12,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:12,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:03:12,948 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1763973021, now seen corresponding path program 2 times [2020-10-15 22:03:12,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:12,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653640984] [2020-10-15 22:03:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:13,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653640984] [2020-10-15 22:03:13,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:13,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:03:13,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363775014] [2020-10-15 22:03:13,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:03:13,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:03:13,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:13,164 INFO L87 Difference]: Start difference. First operand 1726 states and 6416 transitions. Second operand 6 states. [2020-10-15 22:03:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:13,261 INFO L93 Difference]: Finished difference Result 1950 states and 7232 transitions. [2020-10-15 22:03:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:13,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 22:03:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:13,274 INFO L225 Difference]: With dead ends: 1950 [2020-10-15 22:03:13,274 INFO L226 Difference]: Without dead ends: 1950 [2020-10-15 22:03:13,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2020-10-15 22:03:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1902. [2020-10-15 22:03:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2020-10-15 22:03:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 7064 transitions. [2020-10-15 22:03:13,334 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 7064 transitions. Word has length 15 [2020-10-15 22:03:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:13,334 INFO L481 AbstractCegarLoop]: Abstraction has 1902 states and 7064 transitions. [2020-10-15 22:03:13,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:03:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 7064 transitions. [2020-10-15 22:03:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:03:13,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:13,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:13,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:03:13,338 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -662040201, now seen corresponding path program 3 times [2020-10-15 22:03:13,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:13,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749957852] [2020-10-15 22:03:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:13,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749957852] [2020-10-15 22:03:13,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:13,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:03:13,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215950968] [2020-10-15 22:03:13,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:03:13,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:03:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:13,425 INFO L87 Difference]: Start difference. First operand 1902 states and 7064 transitions. Second operand 6 states. [2020-10-15 22:03:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:13,548 INFO L93 Difference]: Finished difference Result 1998 states and 7374 transitions. [2020-10-15 22:03:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:03:13,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 22:03:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:13,559 INFO L225 Difference]: With dead ends: 1998 [2020-10-15 22:03:13,560 INFO L226 Difference]: Without dead ends: 1998 [2020-10-15 22:03:13,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:03:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2020-10-15 22:03:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1874. [2020-10-15 22:03:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-10-15 22:03:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6892 transitions. [2020-10-15 22:03:13,619 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6892 transitions. Word has length 15 [2020-10-15 22:03:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:13,619 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 6892 transitions. [2020-10-15 22:03:13,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:03:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6892 transitions. [2020-10-15 22:03:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:03:13,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:13,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:13,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:03:13,623 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1177270598, now seen corresponding path program 1 times [2020-10-15 22:03:13,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:13,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802525961] [2020-10-15 22:03:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:13,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802525961] [2020-10-15 22:03:13,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:13,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:03:13,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244544962] [2020-10-15 22:03:13,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:03:13,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:03:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:03:13,781 INFO L87 Difference]: Start difference. First operand 1874 states and 6892 transitions. Second operand 7 states. [2020-10-15 22:03:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:13,893 INFO L93 Difference]: Finished difference Result 2178 states and 8052 transitions. [2020-10-15 22:03:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:13,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 22:03:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:13,903 INFO L225 Difference]: With dead ends: 2178 [2020-10-15 22:03:13,903 INFO L226 Difference]: Without dead ends: 2178 [2020-10-15 22:03:13,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:03:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2020-10-15 22:03:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1986. [2020-10-15 22:03:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2020-10-15 22:03:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 7348 transitions. [2020-10-15 22:03:13,978 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 7348 transitions. Word has length 16 [2020-10-15 22:03:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:13,978 INFO L481 AbstractCegarLoop]: Abstraction has 1986 states and 7348 transitions. [2020-10-15 22:03:13,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:03:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 7348 transitions. [2020-10-15 22:03:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:03:13,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:13,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:13,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:03:13,982 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1151409158, now seen corresponding path program 2 times [2020-10-15 22:03:13,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:13,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654308788] [2020-10-15 22:03:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:14,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654308788] [2020-10-15 22:03:14,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:14,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:03:14,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302475876] [2020-10-15 22:03:14,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:03:14,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:03:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:03:14,231 INFO L87 Difference]: Start difference. First operand 1986 states and 7348 transitions. Second operand 7 states. [2020-10-15 22:03:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:14,384 INFO L93 Difference]: Finished difference Result 1930 states and 7128 transitions. [2020-10-15 22:03:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:14,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 22:03:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:14,392 INFO L225 Difference]: With dead ends: 1930 [2020-10-15 22:03:14,392 INFO L226 Difference]: Without dead ends: 1930 [2020-10-15 22:03:14,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:03:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-10-15 22:03:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1626. [2020-10-15 22:03:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-15 22:03:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5968 transitions. [2020-10-15 22:03:14,443 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5968 transitions. Word has length 16 [2020-10-15 22:03:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:14,443 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 5968 transitions. [2020-10-15 22:03:14,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:03:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5968 transitions. [2020-10-15 22:03:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:03:14,447 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:14,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:14,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:03:14,447 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 974833126, now seen corresponding path program 1 times [2020-10-15 22:03:14,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:14,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682834238] [2020-10-15 22:03:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:14,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682834238] [2020-10-15 22:03:14,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:14,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:14,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434885364] [2020-10-15 22:03:14,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:03:14,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:03:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:03:14,503 INFO L87 Difference]: Start difference. First operand 1626 states and 5968 transitions. Second operand 4 states. [2020-10-15 22:03:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:14,535 INFO L93 Difference]: Finished difference Result 1728 states and 5807 transitions. [2020-10-15 22:03:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:14,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 22:03:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:14,541 INFO L225 Difference]: With dead ends: 1728 [2020-10-15 22:03:14,541 INFO L226 Difference]: Without dead ends: 1296 [2020-10-15 22:03:14,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2020-10-15 22:03:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2020-10-15 22:03:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2020-10-15 22:03:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4318 transitions. [2020-10-15 22:03:14,577 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 4318 transitions. Word has length 16 [2020-10-15 22:03:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:14,577 INFO L481 AbstractCegarLoop]: Abstraction has 1296 states and 4318 transitions. [2020-10-15 22:03:14,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:03:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 4318 transitions. [2020-10-15 22:03:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:03:14,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:14,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:14,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:03:14,581 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash -350364005, now seen corresponding path program 1 times [2020-10-15 22:03:14,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:14,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584347614] [2020-10-15 22:03:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:14,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584347614] [2020-10-15 22:03:14,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:14,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:03:14,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681910059] [2020-10-15 22:03:14,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:03:14,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:03:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:14,639 INFO L87 Difference]: Start difference. First operand 1296 states and 4318 transitions. Second operand 5 states. [2020-10-15 22:03:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:14,693 INFO L93 Difference]: Finished difference Result 1156 states and 3549 transitions. [2020-10-15 22:03:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:03:14,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 22:03:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:14,697 INFO L225 Difference]: With dead ends: 1156 [2020-10-15 22:03:14,697 INFO L226 Difference]: Without dead ends: 877 [2020-10-15 22:03:14,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:03:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2020-10-15 22:03:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2020-10-15 22:03:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2020-10-15 22:03:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2642 transitions. [2020-10-15 22:03:14,724 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 2642 transitions. Word has length 17 [2020-10-15 22:03:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:14,725 INFO L481 AbstractCegarLoop]: Abstraction has 877 states and 2642 transitions. [2020-10-15 22:03:14,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:03:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 2642 transitions. [2020-10-15 22:03:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:03:14,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:14,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:14,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:03:14,728 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1278143232, now seen corresponding path program 1 times [2020-10-15 22:03:14,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:14,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143095] [2020-10-15 22:03:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143095] [2020-10-15 22:03:14,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:14,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:03:14,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528129739] [2020-10-15 22:03:14,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:14,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:14,825 INFO L87 Difference]: Start difference. First operand 877 states and 2642 transitions. Second operand 3 states. [2020-10-15 22:03:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:14,847 INFO L93 Difference]: Finished difference Result 1249 states and 3669 transitions. [2020-10-15 22:03:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:14,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-15 22:03:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:14,851 INFO L225 Difference]: With dead ends: 1249 [2020-10-15 22:03:14,852 INFO L226 Difference]: Without dead ends: 887 [2020-10-15 22:03:14,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-15 22:03:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 871. [2020-10-15 22:03:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2020-10-15 22:03:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2481 transitions. [2020-10-15 22:03:14,879 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2481 transitions. Word has length 18 [2020-10-15 22:03:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:14,879 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 2481 transitions. [2020-10-15 22:03:14,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2481 transitions. [2020-10-15 22:03:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 22:03:14,882 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:14,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:14,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:03:14,883 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:14,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 125424893, now seen corresponding path program 1 times [2020-10-15 22:03:14,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:14,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700914759] [2020-10-15 22:03:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:14,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700914759] [2020-10-15 22:03:14,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:14,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:03:14,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700608759] [2020-10-15 22:03:14,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:03:14,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:14,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:03:14,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:03:14,927 INFO L87 Difference]: Start difference. First operand 871 states and 2481 transitions. Second operand 4 states. [2020-10-15 22:03:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:14,962 INFO L93 Difference]: Finished difference Result 1201 states and 3360 transitions. [2020-10-15 22:03:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 22:03:14,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-15 22:03:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:14,966 INFO L225 Difference]: With dead ends: 1201 [2020-10-15 22:03:14,966 INFO L226 Difference]: Without dead ends: 561 [2020-10-15 22:03:14,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:03:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-15 22:03:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2020-10-15 22:03:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-10-15 22:03:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1483 transitions. [2020-10-15 22:03:14,983 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1483 transitions. Word has length 19 [2020-10-15 22:03:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:14,984 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 1483 transitions. [2020-10-15 22:03:14,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:03:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1483 transitions. [2020-10-15 22:03:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 22:03:14,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:14,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:14,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 22:03:14,986 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -900066335, now seen corresponding path program 2 times [2020-10-15 22:03:14,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:14,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311597901] [2020-10-15 22:03:14,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:15,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-15 22:03:15,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311597901] [2020-10-15 22:03:15,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:15,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:03:15,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113176675] [2020-10-15 22:03:15,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:03:15,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:03:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:15,022 INFO L87 Difference]: Start difference. First operand 561 states and 1483 transitions. Second operand 3 states. [2020-10-15 22:03:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:15,035 INFO L93 Difference]: Finished difference Result 757 states and 1944 transitions. [2020-10-15 22:03:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:03:15,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-15 22:03:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:15,038 INFO L225 Difference]: With dead ends: 757 [2020-10-15 22:03:15,038 INFO L226 Difference]: Without dead ends: 569 [2020-10-15 22:03:15,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:03:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-10-15 22:03:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 551. [2020-10-15 22:03:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-10-15 22:03:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1387 transitions. [2020-10-15 22:03:15,053 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1387 transitions. Word has length 19 [2020-10-15 22:03:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:15,054 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 1387 transitions. [2020-10-15 22:03:15,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:03:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1387 transitions. [2020-10-15 22:03:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 22:03:15,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:15,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:15,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 22:03:15,055 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2026188855, now seen corresponding path program 1 times [2020-10-15 22:03:15,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:15,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121609792] [2020-10-15 22:03:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:15,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121609792] [2020-10-15 22:03:15,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:15,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:03:15,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223111151] [2020-10-15 22:03:15,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:03:15,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:03:15,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:03:15,113 INFO L87 Difference]: Start difference. First operand 551 states and 1387 transitions. Second operand 6 states. [2020-10-15 22:03:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:15,183 INFO L93 Difference]: Finished difference Result 474 states and 1145 transitions. [2020-10-15 22:03:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:03:15,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 22:03:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:15,185 INFO L225 Difference]: With dead ends: 474 [2020-10-15 22:03:15,185 INFO L226 Difference]: Without dead ends: 358 [2020-10-15 22:03:15,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:03:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-10-15 22:03:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 338. [2020-10-15 22:03:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-15 22:03:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 790 transitions. [2020-10-15 22:03:15,193 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 790 transitions. Word has length 19 [2020-10-15 22:03:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:15,193 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 790 transitions. [2020-10-15 22:03:15,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:03:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 790 transitions. [2020-10-15 22:03:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 22:03:15,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:15,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:15,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 22:03:15,195 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1225847851, now seen corresponding path program 1 times [2020-10-15 22:03:15,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:15,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441807307] [2020-10-15 22:03:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:03:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:03:15,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441807307] [2020-10-15 22:03:15,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:03:15,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:03:15,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317750994] [2020-10-15 22:03:15,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:03:15,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:03:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:03:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:03:15,268 INFO L87 Difference]: Start difference. First operand 338 states and 790 transitions. Second operand 7 states. [2020-10-15 22:03:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:03:15,354 INFO L93 Difference]: Finished difference Result 317 states and 748 transitions. [2020-10-15 22:03:15,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:03:15,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 22:03:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:03:15,356 INFO L225 Difference]: With dead ends: 317 [2020-10-15 22:03:15,356 INFO L226 Difference]: Without dead ends: 99 [2020-10-15 22:03:15,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:03:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-15 22:03:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2020-10-15 22:03:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-15 22:03:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2020-10-15 22:03:15,359 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 22 [2020-10-15 22:03:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:03:15,359 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2020-10-15 22:03:15,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:03:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2020-10-15 22:03:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-15 22:03:15,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:03:15,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:03:15,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 22:03:15,361 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:03:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:03:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash 358783119, now seen corresponding path program 1 times [2020-10-15 22:03:15,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:03:15,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851144830] [2020-10-15 22:03:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:03:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:03:15,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:03:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:03:15,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:03:15,453 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:03:15,454 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:03:15,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 22:03:15,458 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:03:15,472 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse9 (= (mod ~z$w_buff1_used~0_In390384781 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In390384781 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In390384781 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In390384781 256) 0))) (let ((.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In390384781 0)) (= ~z$r_buff1_thd0~0_In390384781 ~z$r_buff1_thd0~0_Out390384781) (or (and (= ~z$w_buff0_used~0_Out390384781 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_Out390384781 ~z$w_buff0_used~0_In390384781) .cse2)) (= ~z$r_buff0_thd0~0_In390384781 ~z$r_buff0_thd0~0_Out390384781) (or (and .cse3 (= ~z$w_buff1_used~0_Out390384781 ~z$w_buff1_used~0_In390384781)) (and (= ~z$w_buff1_used~0_Out390384781 0) .cse4 .cse5)) (or (and .cse0 .cse1 (= ~z$w_buff0~0_In390384781 ~z~0_Out390384781)) (and (or (and (= ~z~0_In390384781 ~z~0_Out390384781) .cse3) (and .cse4 .cse5 (= ~z$w_buff1~0_In390384781 ~z~0_Out390384781))) .cse2))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In390384781, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In390384781, ~z$w_buff0_used~0=~z$w_buff0_used~0_In390384781, ~z$w_buff0~0=~z$w_buff0~0_In390384781, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In390384781, ~z$w_buff1_used~0=~z$w_buff1_used~0_In390384781, ~z$w_buff1~0=~z$w_buff1~0_In390384781, ~z~0=~z~0_In390384781} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out390384781, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out390384781|, ~z$w_buff0~0=~z$w_buff0~0_In390384781, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out390384781|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out390384781, ~z$w_buff1~0=~z$w_buff1~0_In390384781, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out390384781|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out390384781|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out390384781|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out390384781|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out390384781, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In390384781, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out390384781, ~z~0=~z~0_Out390384781} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-15 22:03:15,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,492 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,492 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,493 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,493 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:03:15,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:03:15,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:03:15 BasicIcfg [2020-10-15 22:03:15,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:03:15,611 INFO L168 Benchmark]: Toolchain (without parser) took 20968.56 ms. Allocated memory was 255.3 MB in the beginning and 588.3 MB in the end (delta: 332.9 MB). Free memory was 210.5 MB in the beginning and 361.7 MB in the end (delta: -151.2 MB). Peak memory consumption was 181.7 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:15,615 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 255.3 MB. Free memory is still 231.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:03:15,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.38 ms. Allocated memory was 255.3 MB in the beginning and 325.6 MB in the end (delta: 70.3 MB). Free memory was 210.5 MB in the beginning and 273.9 MB in the end (delta: -63.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:15,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.07 ms. Allocated memory is still 325.6 MB. Free memory was 273.9 MB in the beginning and 271.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:15,617 INFO L168 Benchmark]: Boogie Preprocessor took 87.94 ms. Allocated memory is still 325.6 MB. Free memory was 271.4 MB in the beginning and 268.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:15,617 INFO L168 Benchmark]: RCFGBuilder took 2087.01 ms. Allocated memory was 325.6 MB in the beginning and 364.9 MB in the end (delta: 39.3 MB). Free memory was 268.9 MB in the beginning and 214.3 MB in the end (delta: 54.5 MB). Peak memory consumption was 97.6 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:15,618 INFO L168 Benchmark]: TraceAbstraction took 17876.27 ms. Allocated memory was 364.9 MB in the beginning and 588.3 MB in the end (delta: 223.3 MB). Free memory was 214.3 MB in the beginning and 361.7 MB in the end (delta: -147.3 MB). Peak memory consumption was 76.0 MB. Max. memory is 14.2 GB. [2020-10-15 22:03:15,624 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 255.3 MB. Free memory is still 231.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 831.38 ms. Allocated memory was 255.3 MB in the beginning and 325.6 MB in the end (delta: 70.3 MB). Free memory was 210.5 MB in the beginning and 273.9 MB in the end (delta: -63.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 80.07 ms. Allocated memory is still 325.6 MB. Free memory was 273.9 MB in the beginning and 271.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 87.94 ms. Allocated memory is still 325.6 MB. Free memory was 271.4 MB in the beginning and 268.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2087.01 ms. Allocated memory was 325.6 MB in the beginning and 364.9 MB in the end (delta: 39.3 MB). Free memory was 268.9 MB in the beginning and 214.3 MB in the end (delta: 54.5 MB). Peak memory consumption was 97.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17876.27 ms. Allocated memory was 364.9 MB in the beginning and 588.3 MB in the end (delta: 223.3 MB). Free memory was 214.3 MB in the beginning and 361.7 MB in the end (delta: -147.3 MB). Peak memory consumption was 76.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1636 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 69 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 186 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.0s, 118 PlacesBefore, 44 PlacesAfterwards, 107 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 5626 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1537; [L824] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1538; [L826] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1539; [L828] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1540; [L830] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L750] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 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) [L771] 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) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 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 [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 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 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] 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) [L847] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] 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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 549 SDtfs, 762 SDslu, 755 SDs, 0 SdLazy, 322 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 746 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 26041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...