/usr/bin/java -Xmx8000000000 -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/mix052_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:52:35,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:52:35,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:52:35,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:52:35,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:52:35,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:52:35,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:52:35,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:52:35,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:52:35,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:52:35,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:52:35,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:52:35,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:52:35,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:52:35,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:52:35,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:52:35,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:52:35,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:52:35,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:52:35,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:52:35,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:52:35,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:52:35,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:52:35,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:52:35,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:52:35,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:52:35,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:52:35,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:52:35,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:52:35,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:52:35,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:52:35,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:52:35,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:52:35,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:52:35,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:52:35,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:52:35,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:52:35,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:52:35,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:52:35,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:52:35,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:52:35,674 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 [2019-12-27 02:52:35,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:52:35,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:52:35,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:52:35,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:52:35,710 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:52:35,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:52:35,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:52:35,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:52:35,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:52:35,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:52:35,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:52:35,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:52:35,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:52:35,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:52:35,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:52:35,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:52:35,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:52:35,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:52:35,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:52:35,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:52:35,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:52:35,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:52:35,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:52:35,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:52:35,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:52:35,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:52:35,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:52:35,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:52:35,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:52:36,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:52:36,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:52:36,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:52:36,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:52:36,034 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:52:36,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 02:52:36,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ac2db38/95fe5b780d47418588dbd4d17cb466be/FLAG841824580 [2019-12-27 02:52:36,671 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:52:36,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 02:52:36,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ac2db38/95fe5b780d47418588dbd4d17cb466be/FLAG841824580 [2019-12-27 02:52:36,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ac2db38/95fe5b780d47418588dbd4d17cb466be [2019-12-27 02:52:36,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:52:36,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:52:36,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:52:36,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:52:36,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:52:36,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:52:36" (1/1) ... [2019-12-27 02:52:36,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17094c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:36, skipping insertion in model container [2019-12-27 02:52:36,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:52:36" (1/1) ... [2019-12-27 02:52:36,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:52:37,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:52:37,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:52:37,572 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:52:37,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:52:37,722 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:52:37,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37 WrapperNode [2019-12-27 02:52:37,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:52:37,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:52:37,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:52:37,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:52:37,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:52:37,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:52:37,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:52:37,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:52:37,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:52:37,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:52:37,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:52:37,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:52:37,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (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 [2019-12-27 02:52:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:52:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:52:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:52:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:52:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:52:37,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:52:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:52:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:52:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:52:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:52:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:52:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:52:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:52:37,912 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:52:38,664 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:52:38,665 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:52:38,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:52:38 BoogieIcfgContainer [2019-12-27 02:52:38,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:52:38,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:52:38,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:52:38,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:52:38,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:52:36" (1/3) ... [2019-12-27 02:52:38,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604419c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:52:38, skipping insertion in model container [2019-12-27 02:52:38,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (2/3) ... [2019-12-27 02:52:38,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604419c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:52:38, skipping insertion in model container [2019-12-27 02:52:38,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:52:38" (3/3) ... [2019-12-27 02:52:38,678 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.opt.i [2019-12-27 02:52:38,689 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:52:38,689 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:52:38,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:52:38,706 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:52:38,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,785 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,785 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,849 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,858 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,860 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:52:38,899 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:52:38,900 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:52:38,900 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:52:38,900 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:52:38,900 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:52:38,900 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:52:38,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:52:38,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:52:38,918 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 02:52:38,920 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:52:39,044 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:52:39,045 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:52:39,062 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:52:39,085 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:52:39,161 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:52:39,161 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:52:39,174 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:52:39,199 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:52:39,200 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:52:44,818 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 02:52:44,951 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:52:45,295 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 02:52:45,295 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:52:45,299 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 02:53:03,204 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 02:53:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 02:53:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:53:03,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:03,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:53:03,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 02:53:03,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:03,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684410587] [2019-12-27 02:53:03,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:03,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684410587] [2019-12-27 02:53:03,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:03,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:53:03,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776353383] [2019-12-27 02:53:03,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:03,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:03,519 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 02:53:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:06,462 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 02:53:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:06,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:53:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:07,041 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 02:53:07,041 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 02:53:07,045 INFO L631 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 [2019-12-27 02:53:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 02:53:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 02:53:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 02:53:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 02:53:16,392 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 02:53:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:16,392 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 02:53:16,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 02:53:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:53:16,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:16,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:16,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 02:53:16,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:16,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431457630] [2019-12-27 02:53:16,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:16,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431457630] [2019-12-27 02:53:16,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:16,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:16,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231124227] [2019-12-27 02:53:16,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:53:16,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:53:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:16,483 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 02:53:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:21,757 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 02:53:21,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:53:21,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:53:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:22,300 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 02:53:22,300 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 02:53:22,301 INFO L631 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 [2019-12-27 02:53:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 02:53:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 02:53:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 02:53:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 02:53:30,534 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 02:53:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:30,534 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 02:53:30,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:53:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 02:53:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:53:30,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:30,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:30,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:30,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 02:53:30,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:30,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71926155] [2019-12-27 02:53:30,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:30,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71926155] [2019-12-27 02:53:30,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:30,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:30,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798265721] [2019-12-27 02:53:30,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:30,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:30,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:30,609 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 02:53:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:30,741 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 02:53:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:30,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:53:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:30,815 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 02:53:30,816 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 02:53:30,816 INFO L631 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 [2019-12-27 02:53:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 02:53:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 02:53:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 02:53:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 02:53:36,278 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 02:53:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:36,279 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 02:53:36,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 02:53:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:53:36,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:36,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:36,282 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 02:53:36,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:36,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280404800] [2019-12-27 02:53:36,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:36,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280404800] [2019-12-27 02:53:36,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:36,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:36,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067700706] [2019-12-27 02:53:36,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:36,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:36,377 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 02:53:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:36,889 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 02:53:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:53:36,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:53:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:36,973 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 02:53:36,974 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 02:53:36,974 INFO L631 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 [2019-12-27 02:53:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 02:53:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 02:53:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 02:53:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 02:53:37,705 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 02:53:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:37,707 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 02:53:37,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 02:53:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:53:37,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:37,716 INFO L411 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] [2019-12-27 02:53:37,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 02:53:37,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:37,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095804692] [2019-12-27 02:53:37,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:37,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095804692] [2019-12-27 02:53:37,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:37,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:53:37,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924392825] [2019-12-27 02:53:37,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:37,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:37,845 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 02:53:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:38,736 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 02:53:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:53:38,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:53:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:38,828 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 02:53:38,828 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 02:53:38,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:53:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 02:53:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 02:53:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 02:53:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 02:53:39,965 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 02:53:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:39,965 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 02:53:39,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 02:53:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:53:39,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:39,979 INFO L411 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] [2019-12-27 02:53:39,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 02:53:39,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:39,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775224806] [2019-12-27 02:53:39,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:40,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775224806] [2019-12-27 02:53:40,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:40,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:40,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914968506] [2019-12-27 02:53:40,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:53:40,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:40,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:53:40,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:40,069 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-27 02:53:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:40,146 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 02:53:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:53:40,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:53:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:40,174 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 02:53:40,174 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 02:53:40,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 02:53:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 02:53:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 02:53:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 02:53:40,410 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 02:53:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:40,410 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 02:53:40,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:53:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 02:53:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:53:40,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:40,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:40,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 02:53:40,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:40,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990674811] [2019-12-27 02:53:40,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990674811] [2019-12-27 02:53:40,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:40,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:53:40,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047049779] [2019-12-27 02:53:40,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:40,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:40,584 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 02:53:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:41,162 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 02:53:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:53:41,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:53:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:41,190 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 02:53:41,191 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 02:53:41,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:53:41,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 02:53:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 02:53:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 02:53:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 02:53:41,477 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 02:53:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:41,477 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 02:53:41,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 02:53:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:53:41,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:41,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:41,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 02:53:41,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:41,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733119279] [2019-12-27 02:53:41,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:41,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733119279] [2019-12-27 02:53:41,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:41,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:53:41,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481560757] [2019-12-27 02:53:41,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:41,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:41,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:41,649 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 02:53:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:42,857 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 02:53:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:53:42,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:53:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:42,892 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 02:53:42,892 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 02:53:42,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:53:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 02:53:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 02:53:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 02:53:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 02:53:43,362 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 02:53:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:43,362 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 02:53:43,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 02:53:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:53:43,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:43,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:43,384 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:43,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:43,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 02:53:43,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:43,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157522635] [2019-12-27 02:53:43,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:43,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157522635] [2019-12-27 02:53:43,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:43,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:53:43,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786307465] [2019-12-27 02:53:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:43,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:43,492 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-27 02:53:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:43,570 INFO L93 Difference]: Finished difference Result 15541 states and 47563 transitions. [2019-12-27 02:53:43,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:53:43,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:53:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:43,592 INFO L225 Difference]: With dead ends: 15541 [2019-12-27 02:53:43,592 INFO L226 Difference]: Without dead ends: 15541 [2019-12-27 02:53:43,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2019-12-27 02:53:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 15044. [2019-12-27 02:53:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15044 states. [2019-12-27 02:53:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15044 states to 15044 states and 46220 transitions. [2019-12-27 02:53:43,820 INFO L78 Accepts]: Start accepts. Automaton has 15044 states and 46220 transitions. Word has length 39 [2019-12-27 02:53:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:43,820 INFO L462 AbstractCegarLoop]: Abstraction has 15044 states and 46220 transitions. [2019-12-27 02:53:43,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15044 states and 46220 transitions. [2019-12-27 02:53:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:43,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:43,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:43,841 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-27 02:53:43,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:43,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365918528] [2019-12-27 02:53:43,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:43,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365918528] [2019-12-27 02:53:43,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:43,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:43,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174331745] [2019-12-27 02:53:43,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:43,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:43,900 INFO L87 Difference]: Start difference. First operand 15044 states and 46220 transitions. Second operand 3 states. [2019-12-27 02:53:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:44,007 INFO L93 Difference]: Finished difference Result 22609 states and 69550 transitions. [2019-12-27 02:53:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:44,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:53:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:44,036 INFO L225 Difference]: With dead ends: 22609 [2019-12-27 02:53:44,037 INFO L226 Difference]: Without dead ends: 22609 [2019-12-27 02:53:44,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22609 states. [2019-12-27 02:53:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22609 to 16710. [2019-12-27 02:53:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-27 02:53:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 52163 transitions. [2019-12-27 02:53:44,329 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 52163 transitions. Word has length 64 [2019-12-27 02:53:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:44,329 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 52163 transitions. [2019-12-27 02:53:44,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 52163 transitions. [2019-12-27 02:53:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:44,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:44,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:44,351 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-27 02:53:44,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:44,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251680211] [2019-12-27 02:53:44,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:44,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251680211] [2019-12-27 02:53:44,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:44,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:44,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215724960] [2019-12-27 02:53:44,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:53:44,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:44,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:53:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:44,434 INFO L87 Difference]: Start difference. First operand 16710 states and 52163 transitions. Second operand 4 states. [2019-12-27 02:53:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:44,550 INFO L93 Difference]: Finished difference Result 31544 states and 98598 transitions. [2019-12-27 02:53:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:53:44,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 02:53:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:44,573 INFO L225 Difference]: With dead ends: 31544 [2019-12-27 02:53:44,573 INFO L226 Difference]: Without dead ends: 15723 [2019-12-27 02:53:44,574 INFO L631 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 [2019-12-27 02:53:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15723 states. [2019-12-27 02:53:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15723 to 15723. [2019-12-27 02:53:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15723 states. [2019-12-27 02:53:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 48991 transitions. [2019-12-27 02:53:44,807 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 48991 transitions. Word has length 64 [2019-12-27 02:53:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:44,807 INFO L462 AbstractCegarLoop]: Abstraction has 15723 states and 48991 transitions. [2019-12-27 02:53:44,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:53:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 48991 transitions. [2019-12-27 02:53:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:44,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:44,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:44,825 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-27 02:53:44,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:44,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039504170] [2019-12-27 02:53:44,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:44,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039504170] [2019-12-27 02:53:44,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:44,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:44,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597732757] [2019-12-27 02:53:44,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:44,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:44,935 INFO L87 Difference]: Start difference. First operand 15723 states and 48991 transitions. Second operand 7 states. [2019-12-27 02:53:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:45,482 INFO L93 Difference]: Finished difference Result 46938 states and 144585 transitions. [2019-12-27 02:53:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:53:45,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:53:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:45,530 INFO L225 Difference]: With dead ends: 46938 [2019-12-27 02:53:45,531 INFO L226 Difference]: Without dead ends: 33282 [2019-12-27 02:53:45,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:53:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2019-12-27 02:53:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 18382. [2019-12-27 02:53:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-27 02:53:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 57406 transitions. [2019-12-27 02:53:46,137 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 57406 transitions. Word has length 64 [2019-12-27 02:53:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:46,137 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 57406 transitions. [2019-12-27 02:53:46,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 57406 transitions. [2019-12-27 02:53:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:46,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:46,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:46,160 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-27 02:53:46,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:46,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843261538] [2019-12-27 02:53:46,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:46,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843261538] [2019-12-27 02:53:46,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:46,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:46,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692661031] [2019-12-27 02:53:46,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:46,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:46,286 INFO L87 Difference]: Start difference. First operand 18382 states and 57406 transitions. Second operand 7 states. [2019-12-27 02:53:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:46,828 INFO L93 Difference]: Finished difference Result 51331 states and 159915 transitions. [2019-12-27 02:53:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:53:46,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:53:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:46,886 INFO L225 Difference]: With dead ends: 51331 [2019-12-27 02:53:46,887 INFO L226 Difference]: Without dead ends: 39815 [2019-12-27 02:53:46,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:53:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-27 02:53:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 21811. [2019-12-27 02:53:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-27 02:53:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 68616 transitions. [2019-12-27 02:53:47,381 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 68616 transitions. Word has length 64 [2019-12-27 02:53:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:47,381 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 68616 transitions. [2019-12-27 02:53:47,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 68616 transitions. [2019-12-27 02:53:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:47,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:47,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:47,421 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:47,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:47,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 4 times [2019-12-27 02:53:47,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:47,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367966081] [2019-12-27 02:53:47,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:47,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367966081] [2019-12-27 02:53:47,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:47,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:47,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664156389] [2019-12-27 02:53:47,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:47,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:47,556 INFO L87 Difference]: Start difference. First operand 21811 states and 68616 transitions. Second operand 7 states. [2019-12-27 02:53:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:48,022 INFO L93 Difference]: Finished difference Result 45057 states and 140142 transitions. [2019-12-27 02:53:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:53:48,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:53:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:48,084 INFO L225 Difference]: With dead ends: 45057 [2019-12-27 02:53:48,084 INFO L226 Difference]: Without dead ends: 40843 [2019-12-27 02:53:48,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:53:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-27 02:53:48,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 22027. [2019-12-27 02:53:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22027 states. [2019-12-27 02:53:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22027 states to 22027 states and 69303 transitions. [2019-12-27 02:53:48,566 INFO L78 Accepts]: Start accepts. Automaton has 22027 states and 69303 transitions. Word has length 64 [2019-12-27 02:53:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:48,567 INFO L462 AbstractCegarLoop]: Abstraction has 22027 states and 69303 transitions. [2019-12-27 02:53:48,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 69303 transitions. [2019-12-27 02:53:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:48,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:48,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:48,592 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-27 02:53:48,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:48,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362378637] [2019-12-27 02:53:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:48,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362378637] [2019-12-27 02:53:48,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:48,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:53:48,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206731754] [2019-12-27 02:53:48,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:48,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:48,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:48,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:48,684 INFO L87 Difference]: Start difference. First operand 22027 states and 69303 transitions. Second operand 5 states. [2019-12-27 02:53:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:49,521 INFO L93 Difference]: Finished difference Result 34201 states and 104680 transitions. [2019-12-27 02:53:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:53:49,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 02:53:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:49,585 INFO L225 Difference]: With dead ends: 34201 [2019-12-27 02:53:49,585 INFO L226 Difference]: Without dead ends: 34033 [2019-12-27 02:53:49,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-27 02:53:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 28062. [2019-12-27 02:53:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28062 states. [2019-12-27 02:53:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28062 states to 28062 states and 87165 transitions. [2019-12-27 02:53:50,040 INFO L78 Accepts]: Start accepts. Automaton has 28062 states and 87165 transitions. Word has length 64 [2019-12-27 02:53:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:50,041 INFO L462 AbstractCegarLoop]: Abstraction has 28062 states and 87165 transitions. [2019-12-27 02:53:50,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28062 states and 87165 transitions. [2019-12-27 02:53:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:50,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:50,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:50,070 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -738203667, now seen corresponding path program 6 times [2019-12-27 02:53:50,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:50,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175346721] [2019-12-27 02:53:50,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:50,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175346721] [2019-12-27 02:53:50,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:53:50,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955072955] [2019-12-27 02:53:50,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:50,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:50,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:50,146 INFO L87 Difference]: Start difference. First operand 28062 states and 87165 transitions. Second operand 5 states. [2019-12-27 02:53:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:50,534 INFO L93 Difference]: Finished difference Result 30014 states and 92644 transitions. [2019-12-27 02:53:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:53:50,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 02:53:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:50,577 INFO L225 Difference]: With dead ends: 30014 [2019-12-27 02:53:50,577 INFO L226 Difference]: Without dead ends: 30014 [2019-12-27 02:53:50,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30014 states. [2019-12-27 02:53:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30014 to 28475. [2019-12-27 02:53:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28475 states. [2019-12-27 02:53:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 88433 transitions. [2019-12-27 02:53:51,033 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 88433 transitions. Word has length 64 [2019-12-27 02:53:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:51,034 INFO L462 AbstractCegarLoop]: Abstraction has 28475 states and 88433 transitions. [2019-12-27 02:53:51,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 88433 transitions. [2019-12-27 02:53:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:51,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:51,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:51,066 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2028716035, now seen corresponding path program 7 times [2019-12-27 02:53:51,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:51,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664955447] [2019-12-27 02:53:51,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:51,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664955447] [2019-12-27 02:53:51,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:51,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:51,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693822491] [2019-12-27 02:53:51,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:51,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:51,164 INFO L87 Difference]: Start difference. First operand 28475 states and 88433 transitions. Second operand 6 states. [2019-12-27 02:53:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:51,953 INFO L93 Difference]: Finished difference Result 48040 states and 146628 transitions. [2019-12-27 02:53:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:53:51,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 02:53:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:52,024 INFO L225 Difference]: With dead ends: 48040 [2019-12-27 02:53:52,024 INFO L226 Difference]: Without dead ends: 47747 [2019-12-27 02:53:52,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:53:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-27 02:53:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 36218. [2019-12-27 02:53:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36218 states. [2019-12-27 02:53:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36218 states to 36218 states and 112422 transitions. [2019-12-27 02:53:52,948 INFO L78 Accepts]: Start accepts. Automaton has 36218 states and 112422 transitions. Word has length 64 [2019-12-27 02:53:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:52,948 INFO L462 AbstractCegarLoop]: Abstraction has 36218 states and 112422 transitions. [2019-12-27 02:53:52,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 36218 states and 112422 transitions. [2019-12-27 02:53:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:52,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:52,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:52,988 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2089785517, now seen corresponding path program 8 times [2019-12-27 02:53:52,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:52,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646895299] [2019-12-27 02:53:52,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:53,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646895299] [2019-12-27 02:53:53,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:53,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:53,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732136374] [2019-12-27 02:53:53,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:53,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:53,101 INFO L87 Difference]: Start difference. First operand 36218 states and 112422 transitions. Second operand 3 states. [2019-12-27 02:53:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:53,250 INFO L93 Difference]: Finished difference Result 36218 states and 112421 transitions. [2019-12-27 02:53:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:53,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:53:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:53,304 INFO L225 Difference]: With dead ends: 36218 [2019-12-27 02:53:53,304 INFO L226 Difference]: Without dead ends: 36218 [2019-12-27 02:53:53,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2019-12-27 02:53:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 31693. [2019-12-27 02:53:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31693 states. [2019-12-27 02:53:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31693 states to 31693 states and 99497 transitions. [2019-12-27 02:53:53,858 INFO L78 Accepts]: Start accepts. Automaton has 31693 states and 99497 transitions. Word has length 64 [2019-12-27 02:53:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:53,859 INFO L462 AbstractCegarLoop]: Abstraction has 31693 states and 99497 transitions. [2019-12-27 02:53:53,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 31693 states and 99497 transitions. [2019-12-27 02:53:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:53:53,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:53,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:53,896 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1914914851, now seen corresponding path program 1 times [2019-12-27 02:53:53,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:53,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385832090] [2019-12-27 02:53:53,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:53,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385832090] [2019-12-27 02:53:53,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:53,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:53,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319827073] [2019-12-27 02:53:53,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:53,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:53,988 INFO L87 Difference]: Start difference. First operand 31693 states and 99497 transitions. Second operand 6 states. [2019-12-27 02:53:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:54,613 INFO L93 Difference]: Finished difference Result 33466 states and 104373 transitions. [2019-12-27 02:53:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:53:54,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 02:53:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:54,684 INFO L225 Difference]: With dead ends: 33466 [2019-12-27 02:53:54,684 INFO L226 Difference]: Without dead ends: 33466 [2019-12-27 02:53:54,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:53:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33466 states. [2019-12-27 02:53:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33466 to 31726. [2019-12-27 02:53:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31726 states. [2019-12-27 02:53:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31726 states to 31726 states and 99597 transitions. [2019-12-27 02:53:55,278 INFO L78 Accepts]: Start accepts. Automaton has 31726 states and 99597 transitions. Word has length 65 [2019-12-27 02:53:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:55,278 INFO L462 AbstractCegarLoop]: Abstraction has 31726 states and 99597 transitions. [2019-12-27 02:53:55,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31726 states and 99597 transitions. [2019-12-27 02:53:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:53:55,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:55,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:55,314 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:55,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1796094165, now seen corresponding path program 2 times [2019-12-27 02:53:55,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:55,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140485692] [2019-12-27 02:53:55,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:55,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140485692] [2019-12-27 02:53:55,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:55,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:55,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169724021] [2019-12-27 02:53:55,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:55,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:55,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:55,390 INFO L87 Difference]: Start difference. First operand 31726 states and 99597 transitions. Second operand 3 states. [2019-12-27 02:53:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:55,492 INFO L93 Difference]: Finished difference Result 23388 states and 72333 transitions. [2019-12-27 02:53:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:55,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:53:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:55,534 INFO L225 Difference]: With dead ends: 23388 [2019-12-27 02:53:55,534 INFO L226 Difference]: Without dead ends: 23388 [2019-12-27 02:53:55,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2019-12-27 02:53:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 22384. [2019-12-27 02:53:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22384 states. [2019-12-27 02:53:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22384 states to 22384 states and 69136 transitions. [2019-12-27 02:53:56,127 INFO L78 Accepts]: Start accepts. Automaton has 22384 states and 69136 transitions. Word has length 65 [2019-12-27 02:53:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:56,128 INFO L462 AbstractCegarLoop]: Abstraction has 22384 states and 69136 transitions. [2019-12-27 02:53:56,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22384 states and 69136 transitions. [2019-12-27 02:53:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:53:56,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:56,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:56,155 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-27 02:53:56,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:56,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770162442] [2019-12-27 02:53:56,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:56,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770162442] [2019-12-27 02:53:56,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:56,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:53:56,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103547203] [2019-12-27 02:53:56,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:53:56,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:53:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:53:56,258 INFO L87 Difference]: Start difference. First operand 22384 states and 69136 transitions. Second operand 8 states. [2019-12-27 02:53:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:58,462 INFO L93 Difference]: Finished difference Result 36775 states and 110702 transitions. [2019-12-27 02:53:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:53:58,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:53:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:58,533 INFO L225 Difference]: With dead ends: 36775 [2019-12-27 02:53:58,533 INFO L226 Difference]: Without dead ends: 36503 [2019-12-27 02:53:58,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:53:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36503 states. [2019-12-27 02:53:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36503 to 24201. [2019-12-27 02:53:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24201 states. [2019-12-27 02:53:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24201 states to 24201 states and 74702 transitions. [2019-12-27 02:53:59,035 INFO L78 Accepts]: Start accepts. Automaton has 24201 states and 74702 transitions. Word has length 66 [2019-12-27 02:53:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:59,036 INFO L462 AbstractCegarLoop]: Abstraction has 24201 states and 74702 transitions. [2019-12-27 02:53:59,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:53:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24201 states and 74702 transitions. [2019-12-27 02:53:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:53:59,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:59,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:59,064 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:53:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1036503919, now seen corresponding path program 2 times [2019-12-27 02:53:59,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:59,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226158564] [2019-12-27 02:53:59,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:53:59,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226158564] [2019-12-27 02:53:59,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:59,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:53:59,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348321451] [2019-12-27 02:53:59,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:53:59,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:53:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:53:59,182 INFO L87 Difference]: Start difference. First operand 24201 states and 74702 transitions. Second operand 9 states. [2019-12-27 02:54:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:00,748 INFO L93 Difference]: Finished difference Result 45743 states and 140753 transitions. [2019-12-27 02:54:00,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:54:00,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 02:54:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:00,803 INFO L225 Difference]: With dead ends: 45743 [2019-12-27 02:54:00,803 INFO L226 Difference]: Without dead ends: 36796 [2019-12-27 02:54:00,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:54:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36796 states. [2019-12-27 02:54:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36796 to 24806. [2019-12-27 02:54:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24806 states. [2019-12-27 02:54:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24806 states to 24806 states and 76001 transitions. [2019-12-27 02:54:01,547 INFO L78 Accepts]: Start accepts. Automaton has 24806 states and 76001 transitions. Word has length 66 [2019-12-27 02:54:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:01,548 INFO L462 AbstractCegarLoop]: Abstraction has 24806 states and 76001 transitions. [2019-12-27 02:54:01,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:54:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 24806 states and 76001 transitions. [2019-12-27 02:54:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:54:01,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:01,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:01,574 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash 216698061, now seen corresponding path program 3 times [2019-12-27 02:54:01,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:01,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004399130] [2019-12-27 02:54:01,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:01,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004399130] [2019-12-27 02:54:01,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:01,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:54:01,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618081273] [2019-12-27 02:54:01,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:54:01,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:54:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:54:01,763 INFO L87 Difference]: Start difference. First operand 24806 states and 76001 transitions. Second operand 11 states. [2019-12-27 02:54:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:03,446 INFO L93 Difference]: Finished difference Result 49982 states and 152918 transitions. [2019-12-27 02:54:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 02:54:03,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:54:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:03,506 INFO L225 Difference]: With dead ends: 49982 [2019-12-27 02:54:03,507 INFO L226 Difference]: Without dead ends: 40195 [2019-12-27 02:54:03,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 02:54:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40195 states. [2019-12-27 02:54:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40195 to 23864. [2019-12-27 02:54:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23864 states. [2019-12-27 02:54:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23864 states to 23864 states and 73092 transitions. [2019-12-27 02:54:04,002 INFO L78 Accepts]: Start accepts. Automaton has 23864 states and 73092 transitions. Word has length 66 [2019-12-27 02:54:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:04,002 INFO L462 AbstractCegarLoop]: Abstraction has 23864 states and 73092 transitions. [2019-12-27 02:54:04,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:54:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 23864 states and 73092 transitions. [2019-12-27 02:54:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:54:04,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:04,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:04,032 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -821584657, now seen corresponding path program 4 times [2019-12-27 02:54:04,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:04,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791285932] [2019-12-27 02:54:04,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:04,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791285932] [2019-12-27 02:54:04,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:04,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:54:04,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469132051] [2019-12-27 02:54:04,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:54:04,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:54:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:04,131 INFO L87 Difference]: Start difference. First operand 23864 states and 73092 transitions. Second operand 4 states. [2019-12-27 02:54:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:04,313 INFO L93 Difference]: Finished difference Result 27941 states and 85304 transitions. [2019-12-27 02:54:04,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:54:04,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:54:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:04,366 INFO L225 Difference]: With dead ends: 27941 [2019-12-27 02:54:04,367 INFO L226 Difference]: Without dead ends: 27941 [2019-12-27 02:54:04,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27941 states. [2019-12-27 02:54:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27941 to 23912. [2019-12-27 02:54:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23912 states. [2019-12-27 02:54:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23912 states to 23912 states and 73418 transitions. [2019-12-27 02:54:04,839 INFO L78 Accepts]: Start accepts. Automaton has 23912 states and 73418 transitions. Word has length 66 [2019-12-27 02:54:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:04,839 INFO L462 AbstractCegarLoop]: Abstraction has 23912 states and 73418 transitions. [2019-12-27 02:54:04,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:54:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 23912 states and 73418 transitions. [2019-12-27 02:54:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:04,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:04,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:04,866 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:04,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-27 02:54:04,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:04,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226305021] [2019-12-27 02:54:04,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:05,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226305021] [2019-12-27 02:54:05,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:05,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:54:05,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479427942] [2019-12-27 02:54:05,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:54:05,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:54:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:54:05,068 INFO L87 Difference]: Start difference. First operand 23912 states and 73418 transitions. Second operand 12 states. [2019-12-27 02:54:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:06,050 INFO L93 Difference]: Finished difference Result 40486 states and 124488 transitions. [2019-12-27 02:54:06,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:54:06,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:54:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:06,109 INFO L225 Difference]: With dead ends: 40486 [2019-12-27 02:54:06,109 INFO L226 Difference]: Without dead ends: 40057 [2019-12-27 02:54:06,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:54:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40057 states. [2019-12-27 02:54:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40057 to 23658. [2019-12-27 02:54:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23658 states. [2019-12-27 02:54:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23658 states to 23658 states and 72774 transitions. [2019-12-27 02:54:06,816 INFO L78 Accepts]: Start accepts. Automaton has 23658 states and 72774 transitions. Word has length 67 [2019-12-27 02:54:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:06,816 INFO L462 AbstractCegarLoop]: Abstraction has 23658 states and 72774 transitions. [2019-12-27 02:54:06,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:54:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23658 states and 72774 transitions. [2019-12-27 02:54:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:06,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:06,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:06,839 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 750664618, now seen corresponding path program 1 times [2019-12-27 02:54:06,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:06,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541680881] [2019-12-27 02:54:06,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:06,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541680881] [2019-12-27 02:54:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:54:06,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055723594] [2019-12-27 02:54:06,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:54:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:54:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:06,882 INFO L87 Difference]: Start difference. First operand 23658 states and 72774 transitions. Second operand 4 states. [2019-12-27 02:54:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:07,181 INFO L93 Difference]: Finished difference Result 35745 states and 110826 transitions. [2019-12-27 02:54:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:54:07,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 02:54:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:07,233 INFO L225 Difference]: With dead ends: 35745 [2019-12-27 02:54:07,234 INFO L226 Difference]: Without dead ends: 35745 [2019-12-27 02:54:07,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:54:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35745 states. [2019-12-27 02:54:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35745 to 25027. [2019-12-27 02:54:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25027 states. [2019-12-27 02:54:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25027 states to 25027 states and 77638 transitions. [2019-12-27 02:54:07,711 INFO L78 Accepts]: Start accepts. Automaton has 25027 states and 77638 transitions. Word has length 67 [2019-12-27 02:54:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:07,712 INFO L462 AbstractCegarLoop]: Abstraction has 25027 states and 77638 transitions. [2019-12-27 02:54:07,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:54:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25027 states and 77638 transitions. [2019-12-27 02:54:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:07,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:07,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:07,741 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:07,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 1 times [2019-12-27 02:54:07,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:07,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032846986] [2019-12-27 02:54:07,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:07,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032846986] [2019-12-27 02:54:07,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:07,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:54:07,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134939415] [2019-12-27 02:54:07,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:54:07,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:54:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:54:07,949 INFO L87 Difference]: Start difference. First operand 25027 states and 77638 transitions. Second operand 10 states. [2019-12-27 02:54:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:10,574 INFO L93 Difference]: Finished difference Result 44617 states and 137983 transitions. [2019-12-27 02:54:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:54:10,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:54:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:10,641 INFO L225 Difference]: With dead ends: 44617 [2019-12-27 02:54:10,641 INFO L226 Difference]: Without dead ends: 44609 [2019-12-27 02:54:10,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:54:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44609 states. [2019-12-27 02:54:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44609 to 26716. [2019-12-27 02:54:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26716 states. [2019-12-27 02:54:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26716 states to 26716 states and 82150 transitions. [2019-12-27 02:54:11,198 INFO L78 Accepts]: Start accepts. Automaton has 26716 states and 82150 transitions. Word has length 67 [2019-12-27 02:54:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:11,198 INFO L462 AbstractCegarLoop]: Abstraction has 26716 states and 82150 transitions. [2019-12-27 02:54:11,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:54:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 26716 states and 82150 transitions. [2019-12-27 02:54:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:11,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:11,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:11,228 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -3014007, now seen corresponding path program 1 times [2019-12-27 02:54:11,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:11,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349827444] [2019-12-27 02:54:11,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:11,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349827444] [2019-12-27 02:54:11,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:11,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:54:11,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176397360] [2019-12-27 02:54:11,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:54:11,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:54:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:54:11,273 INFO L87 Difference]: Start difference. First operand 26716 states and 82150 transitions. Second operand 3 states. [2019-12-27 02:54:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:11,796 INFO L93 Difference]: Finished difference Result 35534 states and 108780 transitions. [2019-12-27 02:54:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:54:11,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 02:54:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:11,886 INFO L225 Difference]: With dead ends: 35534 [2019-12-27 02:54:11,886 INFO L226 Difference]: Without dead ends: 35534 [2019-12-27 02:54:11,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:54:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35534 states. [2019-12-27 02:54:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35534 to 25407. [2019-12-27 02:54:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25407 states. [2019-12-27 02:54:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25407 states to 25407 states and 77774 transitions. [2019-12-27 02:54:12,647 INFO L78 Accepts]: Start accepts. Automaton has 25407 states and 77774 transitions. Word has length 67 [2019-12-27 02:54:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:12,647 INFO L462 AbstractCegarLoop]: Abstraction has 25407 states and 77774 transitions. [2019-12-27 02:54:12,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:54:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 25407 states and 77774 transitions. [2019-12-27 02:54:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:12,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:12,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:12,676 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 2 times [2019-12-27 02:54:12,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:12,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689709430] [2019-12-27 02:54:12,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:12,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689709430] [2019-12-27 02:54:12,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:12,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:54:12,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838345680] [2019-12-27 02:54:12,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:54:12,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:12,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:54:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:54:12,804 INFO L87 Difference]: Start difference. First operand 25407 states and 77774 transitions. Second operand 10 states. [2019-12-27 02:54:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:14,573 INFO L93 Difference]: Finished difference Result 55994 states and 174011 transitions. [2019-12-27 02:54:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 02:54:14,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:54:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:14,658 INFO L225 Difference]: With dead ends: 55994 [2019-12-27 02:54:14,658 INFO L226 Difference]: Without dead ends: 55994 [2019-12-27 02:54:14,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:54:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55994 states. [2019-12-27 02:54:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55994 to 27160. [2019-12-27 02:54:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27160 states. [2019-12-27 02:54:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27160 states to 27160 states and 83332 transitions. [2019-12-27 02:54:15,310 INFO L78 Accepts]: Start accepts. Automaton has 27160 states and 83332 transitions. Word has length 67 [2019-12-27 02:54:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:15,310 INFO L462 AbstractCegarLoop]: Abstraction has 27160 states and 83332 transitions. [2019-12-27 02:54:15,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:54:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27160 states and 83332 transitions. [2019-12-27 02:54:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:15,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:15,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:15,340 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-27 02:54:15,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:15,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140493550] [2019-12-27 02:54:15,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:15,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140493550] [2019-12-27 02:54:15,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:15,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:54:15,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218492506] [2019-12-27 02:54:15,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:54:15,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:54:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:54:15,458 INFO L87 Difference]: Start difference. First operand 27160 states and 83332 transitions. Second operand 6 states. [2019-12-27 02:54:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:15,645 INFO L93 Difference]: Finished difference Result 27005 states and 82599 transitions. [2019-12-27 02:54:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:54:15,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 02:54:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:15,703 INFO L225 Difference]: With dead ends: 27005 [2019-12-27 02:54:15,704 INFO L226 Difference]: Without dead ends: 27005 [2019-12-27 02:54:15,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:54:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27005 states. [2019-12-27 02:54:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27005 to 21810. [2019-12-27 02:54:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21810 states. [2019-12-27 02:54:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21810 states to 21810 states and 65942 transitions. [2019-12-27 02:54:16,282 INFO L78 Accepts]: Start accepts. Automaton has 21810 states and 65942 transitions. Word has length 67 [2019-12-27 02:54:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:16,283 INFO L462 AbstractCegarLoop]: Abstraction has 21810 states and 65942 transitions. [2019-12-27 02:54:16,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:54:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21810 states and 65942 transitions. [2019-12-27 02:54:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:16,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:16,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:16,315 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:54:16,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-27 02:54:16,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:16,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586722417] [2019-12-27 02:54:16,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:54:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:54:16,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:54:16,467 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:54:16,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_26|) 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1388~0.base_26|) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_26|) |v_ULTIMATE.start_main_~#t1388~0.offset_19| 0)) |v_#memory_int_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_26| 1) |v_#valid_69|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1388~0.base_26| 4)) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t1388~0.offset_19| 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_~#t1388~0.base=|v_ULTIMATE.start_main_~#t1388~0.base_26|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_23|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132, ULTIMATE.start_main_~#t1388~0.offset=|v_ULTIMATE.start_main_~#t1388~0.offset_19|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_12|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1389~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1390~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1388~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1389~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1388~0.offset, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-27 02:54:16,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1389~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1389~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t1389~0.base_9| 0)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1389~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9|) |v_ULTIMATE.start_main_~#t1389~0.offset_8| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_9|, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1389~0.base, ULTIMATE.start_main_~#t1389~0.offset] because there is no mapped edge [2019-12-27 02:54:16,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_In-470809631 ~z$w_buff1_used~0_Out-470809631) (= ~z$w_buff0_used~0_Out-470809631 1) (= ~z$w_buff0~0_Out-470809631 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-470809631| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-470809631) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-470809631|) (= |P0Thread1of1ForFork0_#in~arg.base_In-470809631| P0Thread1of1ForFork0_~arg.base_Out-470809631) (= ~z$w_buff1~0_Out-470809631 ~z$w_buff0~0_In-470809631) (= 0 (mod ~z$w_buff1_used~0_Out-470809631 256)) (= P0Thread1of1ForFork0_~arg.offset_Out-470809631 |P0Thread1of1ForFork0_#in~arg.offset_In-470809631|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-470809631|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-470809631, ~z$w_buff0~0=~z$w_buff0~0_In-470809631, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-470809631|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-470809631|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-470809631, ~z$w_buff0~0=~z$w_buff0~0_Out-470809631, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-470809631, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-470809631, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-470809631|, ~z$w_buff1~0=~z$w_buff1~0_Out-470809631, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-470809631, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-470809631|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-470809631} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:54:16,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1390~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11|) |v_ULTIMATE.start_main_~#t1390~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1390~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1390~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1390~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1390~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-27 02:54:16,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In2128733402 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out2128733402| |P1Thread1of1ForFork1_#t~ite9_Out2128733402|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In2128733402 256) 0))) (or (and (= ~z~0_In2128733402 |P1Thread1of1ForFork1_#t~ite9_Out2128733402|) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In2128733402 |P1Thread1of1ForFork1_#t~ite9_Out2128733402|) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2128733402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2128733402, ~z$w_buff1~0=~z$w_buff1~0_In2128733402, ~z~0=~z~0_In2128733402} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2128733402|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2128733402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2128733402, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out2128733402|, ~z$w_buff1~0=~z$w_buff1~0_In2128733402, ~z~0=~z~0_In2128733402} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 02:54:16,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1843735004 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1843735004 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1843735004|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1843735004| ~z$w_buff0_used~0_In1843735004)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1843735004, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1843735004} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1843735004, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1843735004|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1843735004} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:54:16,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2032018622 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2032018622 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-2032018622 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2032018622 256) 0))) (or (and (= ~z$w_buff1_used~0_In-2032018622 |P1Thread1of1ForFork1_#t~ite12_Out-2032018622|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out-2032018622| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2032018622, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2032018622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2032018622, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2032018622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2032018622, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2032018622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2032018622, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2032018622|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2032018622} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:54:16,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2013378894 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-2013378894 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-2013378894|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-2013378894| ~z$r_buff0_thd2~0_In-2013378894) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2013378894, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2013378894} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2013378894, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2013378894|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2013378894} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 02:54:16,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In575569122 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out575569122| ~z$w_buff1~0_In575569122) (= |P2Thread1of1ForFork2_#t~ite24_Out575569122| |P2Thread1of1ForFork2_#t~ite23_Out575569122|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In575569122 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In575569122 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In575569122 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In575569122 256)))))) (and (= |P2Thread1of1ForFork2_#t~ite24_Out575569122| ~z$w_buff1~0_In575569122) (= |P2Thread1of1ForFork2_#t~ite23_In575569122| |P2Thread1of1ForFork2_#t~ite23_Out575569122|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In575569122|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In575569122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In575569122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575569122, ~z$w_buff1~0=~z$w_buff1~0_In575569122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575569122, ~weak$$choice2~0=~weak$$choice2~0_In575569122} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out575569122|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out575569122|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In575569122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In575569122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575569122, ~z$w_buff1~0=~z$w_buff1~0_In575569122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In575569122, ~weak$$choice2~0=~weak$$choice2~0_In575569122} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 02:54:16,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1766902371 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out1766902371| ~z$w_buff0_used~0_In1766902371) (= |P2Thread1of1ForFork2_#t~ite26_In1766902371| |P2Thread1of1ForFork2_#t~ite26_Out1766902371|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out1766902371| ~z$w_buff0_used~0_In1766902371) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1766902371 256)))) (or (= (mod ~z$w_buff0_used~0_In1766902371 256) 0) (and (= (mod ~z$w_buff1_used~0_In1766902371 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In1766902371 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out1766902371| |P2Thread1of1ForFork2_#t~ite27_Out1766902371|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1766902371|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1766902371, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1766902371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1766902371, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1766902371, ~weak$$choice2~0=~weak$$choice2~0_In1766902371} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1766902371|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1766902371, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1766902371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1766902371, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1766902371, ~weak$$choice2~0=~weak$$choice2~0_In1766902371, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1766902371|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 02:54:16,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1573756427 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1573756427 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1573756427 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1573756427 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1573756427|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1573756427 |P1Thread1of1ForFork1_#t~ite14_Out-1573756427|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573756427, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573756427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573756427, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573756427} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573756427, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573756427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573756427, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1573756427|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573756427} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:54:16,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:54:16,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-316083311 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-316083311 256)))) (or (= (mod ~z$w_buff0_used~0_In-316083311 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-316083311 256)) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In-316083311 256) 0) .cse0))) (= |P2Thread1of1ForFork2_#t~ite30_Out-316083311| |P2Thread1of1ForFork2_#t~ite29_Out-316083311|) .cse1 (= ~z$w_buff1_used~0_In-316083311 |P2Thread1of1ForFork2_#t~ite29_Out-316083311|)) (and (= |P2Thread1of1ForFork2_#t~ite29_In-316083311| |P2Thread1of1ForFork2_#t~ite29_Out-316083311|) (= ~z$w_buff1_used~0_In-316083311 |P2Thread1of1ForFork2_#t~ite30_Out-316083311|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-316083311, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-316083311, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316083311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316083311, ~weak$$choice2~0=~weak$$choice2~0_In-316083311, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-316083311|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-316083311|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-316083311, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-316083311, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316083311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316083311, ~weak$$choice2~0=~weak$$choice2~0_In-316083311, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-316083311|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:54:16,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:54:16,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:54:16,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In90673623 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In90673623 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out90673623| 0)) (and (= ~z$w_buff0_used~0_In90673623 |P0Thread1of1ForFork0_#t~ite5_Out90673623|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In90673623, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In90673623} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out90673623|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In90673623, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In90673623} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:54:16,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-616682359 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-616682359 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-616682359 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-616682359 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-616682359| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-616682359 |P0Thread1of1ForFork0_#t~ite6_Out-616682359|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-616682359, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-616682359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-616682359, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-616682359} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-616682359|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-616682359, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-616682359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-616682359, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-616682359} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:54:16,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1089836311 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1089836311 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1089836311) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1089836311 ~z$r_buff0_thd1~0_Out1089836311) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1089836311, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1089836311} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1089836311, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1089836311|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1089836311} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:54:16,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1294654038 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1294654038 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1294654038 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1294654038 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1294654038|)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1294654038| ~z$r_buff1_thd1~0_In-1294654038) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294654038, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1294654038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294654038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1294654038} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294654038, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1294654038|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1294654038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294654038, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1294654038} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:54:16,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:54:16,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out-1262915005| |P2Thread1of1ForFork2_#t~ite38_Out-1262915005|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1262915005 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1262915005 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1262915005| ~z$w_buff1~0_In-1262915005) (not .cse0) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1262915005| ~z~0_In-1262915005) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1262915005, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262915005, ~z$w_buff1~0=~z$w_buff1~0_In-1262915005, ~z~0=~z~0_In-1262915005} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1262915005, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262915005, ~z$w_buff1~0=~z$w_buff1~0_In-1262915005, ~z~0=~z~0_In-1262915005, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1262915005|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1262915005|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 02:54:16,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1112733210 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1112733210 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1112733210 |P2Thread1of1ForFork2_#t~ite40_Out-1112733210|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1112733210|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1112733210, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1112733210} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1112733210, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1112733210, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1112733210|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 02:54:16,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1090051319 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1090051319 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1090051319 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1090051319 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1090051319|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1090051319 |P2Thread1of1ForFork2_#t~ite41_Out1090051319|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1090051319, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1090051319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1090051319, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1090051319} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1090051319|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090051319, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1090051319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1090051319, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1090051319} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 02:54:16,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1645068611 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1645068611 256)))) (or (and (= ~z$r_buff0_thd3~0_In1645068611 |P2Thread1of1ForFork2_#t~ite42_Out1645068611|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out1645068611|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1645068611, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1645068611} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1645068611|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645068611, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1645068611} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 02:54:16,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1830346214 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1830346214 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1830346214 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1830346214 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1830346214 |P2Thread1of1ForFork2_#t~ite43_Out1830346214|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1830346214|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1830346214, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1830346214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830346214, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1830346214} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1830346214, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1830346214, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1830346214|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830346214, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1830346214} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 02:54:16,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:54:16,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:54:16,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1606955434| |ULTIMATE.start_main_#t~ite48_Out1606955434|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1606955434 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1606955434 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1606955434| ~z$w_buff1~0_In1606955434) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In1606955434 |ULTIMATE.start_main_#t~ite47_Out1606955434|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1606955434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606955434, ~z$w_buff1~0=~z$w_buff1~0_In1606955434, ~z~0=~z~0_In1606955434} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1606955434, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1606955434|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606955434, ~z$w_buff1~0=~z$w_buff1~0_In1606955434, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1606955434|, ~z~0=~z~0_In1606955434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:54:16,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In49491147 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In49491147 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out49491147| ~z$w_buff0_used~0_In49491147) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out49491147| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In49491147, ~z$w_buff0_used~0=~z$w_buff0_used~0_In49491147} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In49491147, ~z$w_buff0_used~0=~z$w_buff0_used~0_In49491147, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out49491147|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:54:16,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1820527528 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1820527528 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1820527528 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1820527528 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1820527528| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out-1820527528| ~z$w_buff1_used~0_In-1820527528) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1820527528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820527528, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1820527528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820527528} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1820527528|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1820527528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820527528, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1820527528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820527528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:54:16,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-2110643987 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2110643987 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-2110643987 |ULTIMATE.start_main_#t~ite51_Out-2110643987|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-2110643987| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2110643987, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110643987} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2110643987, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2110643987|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110643987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:54:16,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1356864709 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1356864709 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1356864709 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1356864709 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1356864709| ~z$r_buff1_thd0~0_In-1356864709) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1356864709| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1356864709, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1356864709, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1356864709, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1356864709} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1356864709|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1356864709, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1356864709, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1356864709, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1356864709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:54:16,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:54:16,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:54:16 BasicIcfg [2019-12-27 02:54:16,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:54:16,585 INFO L168 Benchmark]: Toolchain (without parser) took 99633.04 ms. Allocated memory was 143.7 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 98.8 MB in the beginning and 865.3 MB in the end (delta: -766.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,586 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.14 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 98.4 MB in the beginning and 154.0 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.37 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,587 INFO L168 Benchmark]: Boogie Preprocessor took 42.18 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,587 INFO L168 Benchmark]: RCFGBuilder took 835.72 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 98.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,588 INFO L168 Benchmark]: TraceAbstraction took 97915.89 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.9 MB in the beginning and 865.3 MB in the end (delta: -766.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 02:54:16,591 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.14 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 98.4 MB in the beginning and 154.0 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.37 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.18 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.72 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 98.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97915.89 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.9 MB in the beginning and 865.3 MB in the end (delta: -766.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 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) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 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) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6666 SDtfs, 8443 SDslu, 20637 SDs, 0 SdLazy, 12003 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 67 SyntacticMatches, 21 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 269727 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1628 NumberOfCodeBlocks, 1628 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 342416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...