/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:51:46,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:51:46,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:51:46,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:51:46,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:51:46,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:51:46,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:51:46,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:51:46,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:51:46,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:51:46,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:51:46,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:51:46,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:51:46,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:51:46,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:51:46,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:51:46,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:51:46,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:51:46,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:51:46,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:51:46,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:51:46,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:51:46,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:51:46,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:51:46,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:51:46,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:51:46,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:51:46,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:51:46,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:51:46,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:51:46,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:51:46,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:51:46,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:51:46,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:51:46,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:51:46,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:51:46,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:51:46,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:51:46,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:51:46,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:51:46,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:51:46,766 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-VariableLbe.epf [2019-12-27 07:51:46,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:51:46,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:51:46,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:51:46,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:51:46,804 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:51:46,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:51:46,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:51:46,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:51:46,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:51:46,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:51:46,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:51:46,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:51:46,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:51:46,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:51:46,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:51:46,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:51:46,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:51:46,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:51:46,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:51:46,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:51:46,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:51:46,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:51:46,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:51:46,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:51:46,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:51:46,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:51:46,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:51:46,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:51:46,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:51:46,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:51:47,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:51:47,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:51:47,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:51:47,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:51:47,104 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:51:47,105 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-27 07:51:47,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21a04a7e6/9a1c0a298aad49249ed92a0649bbe215/FLAGb2d3b7c7c [2019-12-27 07:51:47,725 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:51:47,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-27 07:51:47,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21a04a7e6/9a1c0a298aad49249ed92a0649bbe215/FLAGb2d3b7c7c [2019-12-27 07:51:48,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21a04a7e6/9a1c0a298aad49249ed92a0649bbe215 [2019-12-27 07:51:48,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:51:48,045 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:51:48,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:48,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:51:48,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:51:48,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c0a7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48, skipping insertion in model container [2019-12-27 07:51:48,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:51:48,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:51:48,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:48,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:51:48,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:48,788 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:51:48,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48 WrapperNode [2019-12-27 07:51:48,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:48,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:48,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:51:48,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:51:48,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:48,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:51:48,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:51:48,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:51:48,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (1/1) ... [2019-12-27 07:51:48,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:51:48,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:51:48,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:51:48,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:51:48,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (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 07:51:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:51:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:51:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:51:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:51:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:51:48,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:51:48,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:51:48,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:51:48,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:51:48,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:51:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:51:48,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:51:48,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:51:48,982 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 07:51:49,758 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:51:49,758 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:51:49,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:49 BoogieIcfgContainer [2019-12-27 07:51:49,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:51:49,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:51:49,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:51:49,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:51:49,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:51:48" (1/3) ... [2019-12-27 07:51:49,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5004349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:49, skipping insertion in model container [2019-12-27 07:51:49,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:48" (2/3) ... [2019-12-27 07:51:49,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5004349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:49, skipping insertion in model container [2019-12-27 07:51:49,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:49" (3/3) ... [2019-12-27 07:51:49,773 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.oepc.i [2019-12-27 07:51:49,784 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:51:49,784 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:51:49,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:51:49,798 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:51:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,889 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,889 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,896 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,897 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:49,957 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:51:49,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:51:49,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:51:49,980 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:51:49,980 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:51:49,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:51:49,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:51:49,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:51:49,981 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:51:49,997 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 07:51:49,999 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:50,125 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:50,126 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:50,146 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 07:51:50,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:50,252 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:50,253 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:50,261 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 07:51:50,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:51:50,284 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:51:53,962 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:51:54,095 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:51:54,115 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 07:51:54,116 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 07:51:54,119 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 07:52:10,033 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 07:52:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 07:52:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:52:10,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:10,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:52:10,042 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 07:52:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 07:52:10,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:10,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429129281] [2019-12-27 07:52:10,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:10,318 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 07:52:10,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429129281] [2019-12-27 07:52:10,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:10,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:52:10,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180654891] [2019-12-27 07:52:10,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:10,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:10,346 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 07:52:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:13,994 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 07:52:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:13,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:52:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:14,624 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 07:52:14,624 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 07:52:14,626 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 07:52:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 07:52:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 07:52:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 07:52:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 07:52:24,943 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 07:52:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:24,944 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 07:52:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 07:52:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:52:24,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:24,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:24,949 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 07:52:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 07:52:24,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:24,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124032715] [2019-12-27 07:52:24,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:25,064 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 07:52:25,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124032715] [2019-12-27 07:52:25,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:25,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:25,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597756101] [2019-12-27 07:52:25,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:25,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:25,068 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 07:52:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:30,416 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 07:52:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:30,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:52:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:31,170 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 07:52:31,170 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 07:52:31,171 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 07:52:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 07:52:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 07:52:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 07:52:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 07:52:40,188 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 07:52:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:40,188 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 07:52:40,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 07:52:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:52:40,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:40,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:40,196 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 07:52:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 07:52:40,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:40,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140316203] [2019-12-27 07:52:40,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:40,262 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 07:52:40,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140316203] [2019-12-27 07:52:40,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:40,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:40,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837166842] [2019-12-27 07:52:40,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:40,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:40,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:40,264 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 07:52:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:40,398 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 07:52:40,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:40,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:52:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:40,474 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 07:52:40,475 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 07:52:40,475 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 07:52:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 07:52:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 07:52:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 07:52:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 07:52:45,576 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 07:52:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:45,577 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 07:52:45,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 07:52:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:52:45,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:45,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:45,580 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 07:52:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 07:52:45,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:45,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635963901] [2019-12-27 07:52:45,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:45,738 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 07:52:45,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635963901] [2019-12-27 07:52:45,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:45,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:45,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658393065] [2019-12-27 07:52:45,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:45,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:45,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:45,741 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 07:52:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:46,248 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 07:52:46,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:52:46,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 07:52:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:46,322 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 07:52:46,323 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 07:52:46,323 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 07:52:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 07:52:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 07:52:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 07:52:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 07:52:47,543 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 07:52:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:47,544 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 07:52:47,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 07:52:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:52:47,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:47,555 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 07:52:47,555 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 07:52:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 07:52:47,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:47,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105189425] [2019-12-27 07:52:47,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:47,684 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 07:52:47,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105189425] [2019-12-27 07:52:47,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:47,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:47,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070752534] [2019-12-27 07:52:47,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:47,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:47,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:47,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:47,686 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 07:52:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:48,768 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 07:52:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:52:48,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:52:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:48,863 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 07:52:48,864 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 07:52:48,864 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 07:52:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 07:52:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 07:52:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 07:52:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 07:52:49,652 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 07:52:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:49,652 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 07:52:49,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 07:52:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:52:49,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:49,667 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 07:52:49,667 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 07:52:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 07:52:49,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:49,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446010915] [2019-12-27 07:52:49,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:50,110 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 07:52:50,113 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 07:52:50,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446010915] [2019-12-27 07:52:50,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:50,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:50,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635298019] [2019-12-27 07:52:50,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:50,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:50,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:50,116 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 07:52:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:50,202 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 07:52:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:50,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:52:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:50,232 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 07:52:50,233 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 07:52:50,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 07:52:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 07:52:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 07:52:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 07:52:50,476 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 07:52:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:50,477 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 07:52:50,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 07:52:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:52:50,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:50,488 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 07:52:50,488 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 07:52:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 07:52:50,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:50,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822537304] [2019-12-27 07:52:50,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:50,592 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 07:52:50,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822537304] [2019-12-27 07:52:50,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:50,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:50,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219738910] [2019-12-27 07:52:50,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:50,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:50,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:50,595 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 07:52:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:51,195 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 07:52:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:52:51,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 07:52:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:51,235 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 07:52:51,236 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 07:52:51,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:52:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 07:52:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 07:52:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 07:52:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 07:52:51,684 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 07:52:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:51,685 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 07:52:51,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 07:52:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:52:51,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:51,715 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 07:52:51,716 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 07:52:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 07:52:51,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:51,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924003184] [2019-12-27 07:52:51,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:51,903 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 07:52:51,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924003184] [2019-12-27 07:52:51,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:51,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:51,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199385575] [2019-12-27 07:52:51,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:51,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:51,905 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 07:52:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:53,159 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 07:52:53,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:52:53,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 07:52:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:53,201 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 07:52:53,201 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 07:52:53,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:52:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 07:52:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 07:52:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 07:52:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 07:52:53,777 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 07:52:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:53,778 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 07:52:53,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 07:52:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:52:53,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:53,801 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 07:52:53,801 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 07:52:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 07:52:53,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:53,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323560702] [2019-12-27 07:52:53,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:53,859 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 07:52:53,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323560702] [2019-12-27 07:52:53,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:53,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:52:53,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261895707] [2019-12-27 07:52:53,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:53,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:53,861 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 07:52:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:53,931 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 07:52:53,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:53,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:52:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:53,961 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 07:52:53,962 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 07:52:53,962 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 07:52:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 07:52:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 07:52:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 07:52:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 07:52:54,203 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 07:52:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:54,203 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 07:52:54,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 07:52:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:54,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:54,225 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] [2019-12-27 07:52:54,225 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 07:52:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 07:52:54,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:54,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133854716] [2019-12-27 07:52:54,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:54,288 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 07:52:54,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133854716] [2019-12-27 07:52:54,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:54,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:54,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102166706] [2019-12-27 07:52:54,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:54,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:54,290 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 07:52:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:54,426 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 07:52:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:54,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 07:52:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:54,462 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 07:52:54,462 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 07:52:54,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 07:52:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 07:52:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 07:52:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 07:52:54,830 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 07:52:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:54,830 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 07:52:54,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 07:52:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:54,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:54,855 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] [2019-12-27 07:52:54,855 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 07:52:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 07:52:54,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:54,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002358327] [2019-12-27 07:52:54,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:54,959 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 07:52:54,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002358327] [2019-12-27 07:52:54,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:54,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:54,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283696691] [2019-12-27 07:52:54,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:54,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:54,961 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 5 states. [2019-12-27 07:52:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:55,562 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 07:52:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:52:55,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:52:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:55,595 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 07:52:55,595 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 07:52:55,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 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 07:52:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 07:52:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 07:52:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 07:52:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 07:52:56,173 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 07:52:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:56,173 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 07:52:56,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 07:52:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:56,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:56,193 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] [2019-12-27 07:52:56,193 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 07:52:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:56,194 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 07:52:56,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:56,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320888317] [2019-12-27 07:52:56,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:56,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 07:52:56,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320888317] [2019-12-27 07:52:56,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:56,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:56,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708738326] [2019-12-27 07:52:56,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:56,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:56,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:56,285 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 5 states. [2019-12-27 07:52:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:56,399 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 07:52:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:56,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:52:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:56,435 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 07:52:56,435 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 07:52:56,435 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 07:52:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 07:52:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 07:52:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 07:52:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 07:52:56,738 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 07:52:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:56,739 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 07:52:56,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 07:52:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:56,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:56,761 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 07:52:56,761 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 07:52:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 07:52:56,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:56,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748037062] [2019-12-27 07:52:56,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:56,807 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 07:52:56,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748037062] [2019-12-27 07:52:56,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:56,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:56,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403541996] [2019-12-27 07:52:56,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:56,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:56,809 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 07:52:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:56,977 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 07:52:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:56,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:52:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:57,044 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 07:52:57,044 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 07:52:57,045 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 07:52:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 07:52:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 07:52:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 07:52:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 07:52:57,729 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 07:52:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:57,729 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 07:52:57,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 07:52:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:57,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:57,761 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 07:52:57,761 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 07:52:57,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 07:52:57,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:57,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897142157] [2019-12-27 07:52:57,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:57,876 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 07:52:57,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897142157] [2019-12-27 07:52:57,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:57,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:57,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713568610] [2019-12-27 07:52:57,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:57,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:57,881 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 07:52:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:58,400 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 07:52:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:52:58,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:58,463 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 07:52:58,463 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 07:52:58,464 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 07:52:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 07:52:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 07:52:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 07:52:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 07:52:59,283 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 07:52:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:59,284 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 07:52:59,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 07:52:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:59,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:59,321 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 07:52:59,322 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 07:52:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 07:52:59,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:59,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018383161] [2019-12-27 07:52:59,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:59,412 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 07:52:59,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018383161] [2019-12-27 07:52:59,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:59,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:59,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238565105] [2019-12-27 07:52:59,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:59,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:59,414 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 07:52:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:59,959 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 07:52:59,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:52:59,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:00,086 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 07:53:00,087 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 07:53:00,091 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 07:53:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 07:53:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 07:53:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 07:53:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 07:53:00,787 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 07:53:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:00,788 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 07:53:00,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:53:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 07:53:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:53:00,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:00,823 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 07:53:00,823 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 07:53:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 07:53:00,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:00,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198622788] [2019-12-27 07:53:00,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:00,920 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 07:53:00,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198622788] [2019-12-27 07:53:00,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:00,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:53:00,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439609081] [2019-12-27 07:53:00,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:53:00,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:53:00,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:53:00,922 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 07:53:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:01,759 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 07:53:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:53:01,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:53:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:01,856 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 07:53:01,856 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 07:53:01,856 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 07:53:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 07:53:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 07:53:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 07:53:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 07:53:02,485 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 07:53:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:02,485 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 07:53:02,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:53:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 07:53:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:53:02,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:02,519 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 07:53:02,519 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 07:53:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 07:53:02,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:02,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211818675] [2019-12-27 07:53:02,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:02,578 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 07:53:02,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211818675] [2019-12-27 07:53:02,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:02,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:02,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413450547] [2019-12-27 07:53:02,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:02,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:02,581 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 07:53:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:02,736 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 07:53:02,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:02,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:53:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:02,784 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 07:53:02,784 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 07:53:02,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 07:53:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 07:53:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 07:53:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 07:53:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 07:53:03,313 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 07:53:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:03,313 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 07:53:03,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 07:53:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:03,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:03,350 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 07:53:03,350 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 07:53:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 07:53:03,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:03,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125040068] [2019-12-27 07:53:03,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:03,404 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 07:53:03,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125040068] [2019-12-27 07:53:03,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:03,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:53:03,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131984633] [2019-12-27 07:53:03,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:03,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:03,407 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 07:53:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:03,924 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 07:53:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:53:03,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:53:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:03,980 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 07:53:03,980 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 07:53:03,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 07:53:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 07:53:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 07:53:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 07:53:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 07:53:04,558 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 07:53:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:04,558 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 07:53:04,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 07:53:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:04,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:04,593 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 07:53:04,593 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 07:53:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 07:53:04,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:04,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284241888] [2019-12-27 07:53:04,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:04,649 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 07:53:04,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284241888] [2019-12-27 07:53:04,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:04,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:53:04,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763109069] [2019-12-27 07:53:04,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:04,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:04,651 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 07:53:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:05,022 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 07:53:05,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:53:05,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:53:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:05,100 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 07:53:05,100 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 07:53:05,101 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 07:53:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 07:53:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 07:53:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 07:53:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 07:53:06,239 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 07:53:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:06,239 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 07:53:06,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 07:53:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:06,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:06,277 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 07:53:06,277 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 07:53:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 07:53:06,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:06,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063275233] [2019-12-27 07:53:06,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:06,355 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 07:53:06,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063275233] [2019-12-27 07:53:06,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:06,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:53:06,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125895928] [2019-12-27 07:53:06,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:53:06,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:06,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:53:06,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:53:06,357 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 07:53:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:06,907 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 07:53:06,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:53:06,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:53:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:07,015 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 07:53:07,015 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 07:53:07,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:53:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 07:53:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 07:53:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 07:53:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 07:53:07,778 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 07:53:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:07,779 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 07:53:07,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:53:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 07:53:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:07,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:07,816 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 07:53:07,816 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 07:53:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 07:53:07,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:07,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027875325] [2019-12-27 07:53:07,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:07,900 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 07:53:07,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027875325] [2019-12-27 07:53:07,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:07,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:53:07,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978766255] [2019-12-27 07:53:07,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:53:07,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:53:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:53:07,904 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-27 07:53:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:08,592 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 07:53:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:53:08,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:53:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:08,689 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 07:53:08,689 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 07:53:08,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:53:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 07:53:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 07:53:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 07:53:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 07:53:09,739 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 07:53:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:09,740 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 07:53:09,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:53:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 07:53:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:09,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:09,779 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 07:53:09,779 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 07:53:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 07:53:09,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:09,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961898038] [2019-12-27 07:53:09,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:09,851 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 07:53:09,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961898038] [2019-12-27 07:53:09,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:09,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:53:09,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538685553] [2019-12-27 07:53:09,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:53:09,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:09,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:53:09,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:53:09,854 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 07:53:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:10,518 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 07:53:10,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:53:10,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:53:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:10,596 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 07:53:10,596 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 07:53:10,596 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 07:53:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 07:53:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 07:53:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 07:53:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 07:53:11,288 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 07:53:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:11,288 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 07:53:11,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:53:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 07:53:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:11,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:11,334 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 07:53:11,335 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 07:53:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:11,335 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 07:53:11,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:11,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106404436] [2019-12-27 07:53:11,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:11,540 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 07:53:11,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106404436] [2019-12-27 07:53:11,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:11,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:53:11,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706593785] [2019-12-27 07:53:11,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:53:11,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:53:11,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:53:11,542 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 11 states. [2019-12-27 07:53:12,165 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-27 07:53:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:14,267 INFO L93 Difference]: Finished difference Result 66182 states and 202868 transitions. [2019-12-27 07:53:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:53:14,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 07:53:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:14,373 INFO L225 Difference]: With dead ends: 66182 [2019-12-27 07:53:14,373 INFO L226 Difference]: Without dead ends: 66063 [2019-12-27 07:53:14,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 07:53:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66063 states. [2019-12-27 07:53:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66063 to 49486. [2019-12-27 07:53:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49486 states. [2019-12-27 07:53:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49486 states to 49486 states and 153569 transitions. [2019-12-27 07:53:15,369 INFO L78 Accepts]: Start accepts. Automaton has 49486 states and 153569 transitions. Word has length 65 [2019-12-27 07:53:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:15,369 INFO L462 AbstractCegarLoop]: Abstraction has 49486 states and 153569 transitions. [2019-12-27 07:53:15,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:53:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49486 states and 153569 transitions. [2019-12-27 07:53:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:15,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:15,433 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 07:53:15,434 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 07:53:15,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:15,434 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 07:53:15,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:15,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851961189] [2019-12-27 07:53:15,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:15,610 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 07:53:15,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851961189] [2019-12-27 07:53:15,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:15,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:53:15,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535728239] [2019-12-27 07:53:15,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:53:15,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:53:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:53:15,612 INFO L87 Difference]: Start difference. First operand 49486 states and 153569 transitions. Second operand 11 states. [2019-12-27 07:53:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:19,036 INFO L93 Difference]: Finished difference Result 79144 states and 241692 transitions. [2019-12-27 07:53:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 07:53:19,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 07:53:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:19,165 INFO L225 Difference]: With dead ends: 79144 [2019-12-27 07:53:19,165 INFO L226 Difference]: Without dead ends: 78848 [2019-12-27 07:53:19,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 07:53:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78848 states. [2019-12-27 07:53:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78848 to 52843. [2019-12-27 07:53:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52843 states. [2019-12-27 07:53:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52843 states to 52843 states and 163234 transitions. [2019-12-27 07:53:20,259 INFO L78 Accepts]: Start accepts. Automaton has 52843 states and 163234 transitions. Word has length 65 [2019-12-27 07:53:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:20,259 INFO L462 AbstractCegarLoop]: Abstraction has 52843 states and 163234 transitions. [2019-12-27 07:53:20,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:53:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 52843 states and 163234 transitions. [2019-12-27 07:53:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:53:20,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:20,326 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 07:53:20,326 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 07:53:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:20,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 07:53:20,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:20,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323207578] [2019-12-27 07:53:20,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:20,393 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 07:53:20,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323207578] [2019-12-27 07:53:20,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:20,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:20,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135378263] [2019-12-27 07:53:20,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:20,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:20,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:20,395 INFO L87 Difference]: Start difference. First operand 52843 states and 163234 transitions. Second operand 3 states. [2019-12-27 07:53:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:20,578 INFO L93 Difference]: Finished difference Result 52843 states and 163233 transitions. [2019-12-27 07:53:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:20,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:53:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:20,663 INFO L225 Difference]: With dead ends: 52843 [2019-12-27 07:53:20,663 INFO L226 Difference]: Without dead ends: 52843 [2019-12-27 07:53:20,663 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 07:53:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52843 states. [2019-12-27 07:53:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52843 to 39255. [2019-12-27 07:53:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39255 states. [2019-12-27 07:53:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39255 states to 39255 states and 124025 transitions. [2019-12-27 07:53:21,850 INFO L78 Accepts]: Start accepts. Automaton has 39255 states and 124025 transitions. Word has length 65 [2019-12-27 07:53:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:21,850 INFO L462 AbstractCegarLoop]: Abstraction has 39255 states and 124025 transitions. [2019-12-27 07:53:21,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 39255 states and 124025 transitions. [2019-12-27 07:53:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:53:21,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:21,902 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 07:53:21,902 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 07:53:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 1 times [2019-12-27 07:53:21,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:21,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616188110] [2019-12-27 07:53:21,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:21,959 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 07:53:21,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616188110] [2019-12-27 07:53:21,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:21,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:21,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132965599] [2019-12-27 07:53:21,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:21,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:21,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:21,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:21,961 INFO L87 Difference]: Start difference. First operand 39255 states and 124025 transitions. Second operand 3 states. [2019-12-27 07:53:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:22,093 INFO L93 Difference]: Finished difference Result 29796 states and 92689 transitions. [2019-12-27 07:53:22,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:22,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:53:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:22,154 INFO L225 Difference]: With dead ends: 29796 [2019-12-27 07:53:22,155 INFO L226 Difference]: Without dead ends: 29796 [2019-12-27 07:53:22,155 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 07:53:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29796 states. [2019-12-27 07:53:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29796 to 28150. [2019-12-27 07:53:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28150 states. [2019-12-27 07:53:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28150 states to 28150 states and 87484 transitions. [2019-12-27 07:53:22,757 INFO L78 Accepts]: Start accepts. Automaton has 28150 states and 87484 transitions. Word has length 66 [2019-12-27 07:53:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:22,757 INFO L462 AbstractCegarLoop]: Abstraction has 28150 states and 87484 transitions. [2019-12-27 07:53:22,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 28150 states and 87484 transitions. [2019-12-27 07:53:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:22,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:22,792 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 07:53:22,792 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 07:53:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 07:53:22,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:22,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413308335] [2019-12-27 07:53:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:23,165 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 07:53:23,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413308335] [2019-12-27 07:53:23,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:23,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:53:23,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602682269] [2019-12-27 07:53:23,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:53:23,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:23,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:53:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:53:23,167 INFO L87 Difference]: Start difference. First operand 28150 states and 87484 transitions. Second operand 15 states. [2019-12-27 07:53:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:28,294 INFO L93 Difference]: Finished difference Result 61360 states and 188106 transitions. [2019-12-27 07:53:28,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 07:53:28,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 07:53:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:28,375 INFO L225 Difference]: With dead ends: 61360 [2019-12-27 07:53:28,376 INFO L226 Difference]: Without dead ends: 51596 [2019-12-27 07:53:28,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 07:53:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51596 states. [2019-12-27 07:53:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51596 to 28910. [2019-12-27 07:53:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28910 states. [2019-12-27 07:53:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28910 states to 28910 states and 89377 transitions. [2019-12-27 07:53:29,023 INFO L78 Accepts]: Start accepts. Automaton has 28910 states and 89377 transitions. Word has length 67 [2019-12-27 07:53:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:29,023 INFO L462 AbstractCegarLoop]: Abstraction has 28910 states and 89377 transitions. [2019-12-27 07:53:29,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:53:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 28910 states and 89377 transitions. [2019-12-27 07:53:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:29,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:29,063 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 07:53:29,063 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 07:53:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:29,064 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-27 07:53:29,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:29,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114043701] [2019-12-27 07:53:29,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:29,500 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 07:53:29,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114043701] [2019-12-27 07:53:29,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:29,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:53:29,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986235493] [2019-12-27 07:53:29,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:53:29,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:53:29,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:53:29,503 INFO L87 Difference]: Start difference. First operand 28910 states and 89377 transitions. Second operand 15 states. [2019-12-27 07:53:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:34,056 INFO L93 Difference]: Finished difference Result 51901 states and 158784 transitions. [2019-12-27 07:53:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 07:53:34,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 07:53:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:34,130 INFO L225 Difference]: With dead ends: 51901 [2019-12-27 07:53:34,130 INFO L226 Difference]: Without dead ends: 51242 [2019-12-27 07:53:34,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 07:53:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51242 states. [2019-12-27 07:53:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51242 to 28670. [2019-12-27 07:53:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28670 states. [2019-12-27 07:53:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28670 states to 28670 states and 88721 transitions. [2019-12-27 07:53:34,703 INFO L78 Accepts]: Start accepts. Automaton has 28670 states and 88721 transitions. Word has length 67 [2019-12-27 07:53:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:34,703 INFO L462 AbstractCegarLoop]: Abstraction has 28670 states and 88721 transitions. [2019-12-27 07:53:34,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:53:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28670 states and 88721 transitions. [2019-12-27 07:53:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:34,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:34,739 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 07:53:34,739 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 07:53:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1184662856, now seen corresponding path program 1 times [2019-12-27 07:53:34,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:34,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430758176] [2019-12-27 07:53:34,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:34,803 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 07:53:34,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430758176] [2019-12-27 07:53:34,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:34,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:53:34,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814029621] [2019-12-27 07:53:34,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:34,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:34,805 INFO L87 Difference]: Start difference. First operand 28670 states and 88721 transitions. Second operand 4 states. [2019-12-27 07:53:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:35,028 INFO L93 Difference]: Finished difference Result 28670 states and 88453 transitions. [2019-12-27 07:53:35,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:53:35,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 07:53:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:35,102 INFO L225 Difference]: With dead ends: 28670 [2019-12-27 07:53:35,102 INFO L226 Difference]: Without dead ends: 28670 [2019-12-27 07:53:35,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 07:53:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28670 states. [2019-12-27 07:53:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28670 to 24475. [2019-12-27 07:53:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24475 states. [2019-12-27 07:53:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24475 states to 24475 states and 75373 transitions. [2019-12-27 07:53:35,703 INFO L78 Accepts]: Start accepts. Automaton has 24475 states and 75373 transitions. Word has length 67 [2019-12-27 07:53:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:35,703 INFO L462 AbstractCegarLoop]: Abstraction has 24475 states and 75373 transitions. [2019-12-27 07:53:35,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 24475 states and 75373 transitions. [2019-12-27 07:53:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:35,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:35,735 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 07:53:35,735 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 07:53:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 3 times [2019-12-27 07:53:35,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:35,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780718631] [2019-12-27 07:53:35,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:36,075 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 07:53:36,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780718631] [2019-12-27 07:53:36,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:36,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:53:36,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247025336] [2019-12-27 07:53:36,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:53:36,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:36,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:53:36,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:53:36,077 INFO L87 Difference]: Start difference. First operand 24475 states and 75373 transitions. Second operand 15 states. [2019-12-27 07:53:39,615 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-27 07:53:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:42,594 INFO L93 Difference]: Finished difference Result 59213 states and 181344 transitions. [2019-12-27 07:53:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 07:53:42,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 07:53:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:42,688 INFO L225 Difference]: With dead ends: 59213 [2019-12-27 07:53:42,688 INFO L226 Difference]: Without dead ends: 56998 [2019-12-27 07:53:42,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 07:53:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56998 states. [2019-12-27 07:53:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56998 to 30975. [2019-12-27 07:53:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30975 states. [2019-12-27 07:53:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30975 states to 30975 states and 95946 transitions. [2019-12-27 07:53:43,405 INFO L78 Accepts]: Start accepts. Automaton has 30975 states and 95946 transitions. Word has length 67 [2019-12-27 07:53:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:43,405 INFO L462 AbstractCegarLoop]: Abstraction has 30975 states and 95946 transitions. [2019-12-27 07:53:43,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:53:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30975 states and 95946 transitions. [2019-12-27 07:53:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:43,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:43,443 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 07:53:43,443 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 07:53:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1338235554, now seen corresponding path program 4 times [2019-12-27 07:53:43,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:43,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383798220] [2019-12-27 07:53:43,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:43,914 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 07:53:43,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383798220] [2019-12-27 07:53:43,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:43,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:53:43,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304970436] [2019-12-27 07:53:43,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:53:43,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:53:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:53:43,917 INFO L87 Difference]: Start difference. First operand 30975 states and 95946 transitions. Second operand 15 states. [2019-12-27 07:53:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:48,526 INFO L93 Difference]: Finished difference Result 57916 states and 176704 transitions. [2019-12-27 07:53:48,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 07:53:48,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 07:53:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:48,590 INFO L225 Difference]: With dead ends: 57916 [2019-12-27 07:53:48,590 INFO L226 Difference]: Without dead ends: 43706 [2019-12-27 07:53:48,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 07:53:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43706 states. [2019-12-27 07:53:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43706 to 24384. [2019-12-27 07:53:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24384 states. [2019-12-27 07:53:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24384 states to 24384 states and 74776 transitions. [2019-12-27 07:53:49,122 INFO L78 Accepts]: Start accepts. Automaton has 24384 states and 74776 transitions. Word has length 67 [2019-12-27 07:53:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:49,122 INFO L462 AbstractCegarLoop]: Abstraction has 24384 states and 74776 transitions. [2019-12-27 07:53:49,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:53:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24384 states and 74776 transitions. [2019-12-27 07:53:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:49,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:49,150 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 07:53:49,151 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 5 times [2019-12-27 07:53:49,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:49,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110126110] [2019-12-27 07:53:49,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:49,550 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 07:53:49,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110126110] [2019-12-27 07:53:49,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:49,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:53:49,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671915856] [2019-12-27 07:53:49,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:53:49,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:53:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:53:49,551 INFO L87 Difference]: Start difference. First operand 24384 states and 74776 transitions. Second operand 16 states. [2019-12-27 07:53:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:54,085 INFO L93 Difference]: Finished difference Result 46453 states and 141230 transitions. [2019-12-27 07:53:54,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 07:53:54,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 07:53:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:54,153 INFO L225 Difference]: With dead ends: 46453 [2019-12-27 07:53:54,153 INFO L226 Difference]: Without dead ends: 45686 [2019-12-27 07:53:54,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 07:53:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45686 states. [2019-12-27 07:53:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45686 to 26676. [2019-12-27 07:53:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26676 states. [2019-12-27 07:53:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26676 states to 26676 states and 81780 transitions. [2019-12-27 07:53:54,926 INFO L78 Accepts]: Start accepts. Automaton has 26676 states and 81780 transitions. Word has length 67 [2019-12-27 07:53:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:54,927 INFO L462 AbstractCegarLoop]: Abstraction has 26676 states and 81780 transitions. [2019-12-27 07:53:54,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:53:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 26676 states and 81780 transitions. [2019-12-27 07:53:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:54,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:54,960 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 07:53:54,960 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 745732250, now seen corresponding path program 6 times [2019-12-27 07:53:54,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:54,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366058775] [2019-12-27 07:53:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:55,355 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 07:53:55,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366058775] [2019-12-27 07:53:55,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:55,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:53:55,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884118940] [2019-12-27 07:53:55,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:53:55,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:53:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:53:55,357 INFO L87 Difference]: Start difference. First operand 26676 states and 81780 transitions. Second operand 16 states. [2019-12-27 07:53:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:59,360 INFO L93 Difference]: Finished difference Result 46273 states and 140211 transitions. [2019-12-27 07:53:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 07:53:59,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 07:53:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:59,421 INFO L225 Difference]: With dead ends: 46273 [2019-12-27 07:53:59,421 INFO L226 Difference]: Without dead ends: 43586 [2019-12-27 07:53:59,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 07:53:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43586 states. [2019-12-27 07:53:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43586 to 24366. [2019-12-27 07:53:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24366 states. [2019-12-27 07:53:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24366 states to 24366 states and 74742 transitions. [2019-12-27 07:53:59,929 INFO L78 Accepts]: Start accepts. Automaton has 24366 states and 74742 transitions. Word has length 67 [2019-12-27 07:53:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:59,930 INFO L462 AbstractCegarLoop]: Abstraction has 24366 states and 74742 transitions. [2019-12-27 07:53:59,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:53:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 24366 states and 74742 transitions. [2019-12-27 07:53:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:59,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:59,958 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 07:53:59,958 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1590486634, now seen corresponding path program 7 times [2019-12-27 07:53:59,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:59,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931179659] [2019-12-27 07:53:59,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:00,051 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 07:54:00,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931179659] [2019-12-27 07:54:00,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:00,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:54:00,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261147720] [2019-12-27 07:54:00,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:54:00,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:00,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:54:00,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:54:00,053 INFO L87 Difference]: Start difference. First operand 24366 states and 74742 transitions. Second operand 9 states. [2019-12-27 07:54:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:01,254 INFO L93 Difference]: Finished difference Result 39510 states and 120208 transitions. [2019-12-27 07:54:01,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:54:01,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 07:54:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:01,301 INFO L225 Difference]: With dead ends: 39510 [2019-12-27 07:54:01,301 INFO L226 Difference]: Without dead ends: 32664 [2019-12-27 07:54:01,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:54:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32664 states. [2019-12-27 07:54:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32664 to 24260. [2019-12-27 07:54:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24260 states. [2019-12-27 07:54:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24260 states to 24260 states and 74311 transitions. [2019-12-27 07:54:01,881 INFO L78 Accepts]: Start accepts. Automaton has 24260 states and 74311 transitions. Word has length 67 [2019-12-27 07:54:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:01,882 INFO L462 AbstractCegarLoop]: Abstraction has 24260 states and 74311 transitions. [2019-12-27 07:54:01,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:54:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24260 states and 74311 transitions. [2019-12-27 07:54:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:54:01,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:01,905 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 07:54:01,905 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:54:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2065181176, now seen corresponding path program 8 times [2019-12-27 07:54:01,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:01,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960971243] [2019-12-27 07:54:01,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:02,510 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 07:54:02,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960971243] [2019-12-27 07:54:02,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:02,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:54:02,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105959066] [2019-12-27 07:54:02,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:54:02,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:02,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:54:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:54:02,512 INFO L87 Difference]: Start difference. First operand 24260 states and 74311 transitions. Second operand 18 states. [2019-12-27 07:54:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:04,893 INFO L93 Difference]: Finished difference Result 28370 states and 85730 transitions. [2019-12-27 07:54:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:54:04,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 07:54:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:04,934 INFO L225 Difference]: With dead ends: 28370 [2019-12-27 07:54:04,934 INFO L226 Difference]: Without dead ends: 27269 [2019-12-27 07:54:04,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 07:54:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27269 states. [2019-12-27 07:54:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27269 to 25380. [2019-12-27 07:54:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25380 states. [2019-12-27 07:54:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25380 states to 25380 states and 77355 transitions. [2019-12-27 07:54:05,322 INFO L78 Accepts]: Start accepts. Automaton has 25380 states and 77355 transitions. Word has length 67 [2019-12-27 07:54:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 25380 states and 77355 transitions. [2019-12-27 07:54:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:54:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25380 states and 77355 transitions. [2019-12-27 07:54:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:54:05,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:05,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, 1, 1, 1] [2019-12-27 07:54:05,351 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:54:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 688286730, now seen corresponding path program 9 times [2019-12-27 07:54:05,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:05,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483732091] [2019-12-27 07:54:05,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:05,525 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 07:54:05,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483732091] [2019-12-27 07:54:05,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:05,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:54:05,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999908314] [2019-12-27 07:54:05,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:54:05,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:54:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:54:05,527 INFO L87 Difference]: Start difference. First operand 25380 states and 77355 transitions. Second operand 11 states. [2019-12-27 07:54:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:06,674 INFO L93 Difference]: Finished difference Result 45338 states and 138320 transitions. [2019-12-27 07:54:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:54:06,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:54:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:06,727 INFO L225 Difference]: With dead ends: 45338 [2019-12-27 07:54:06,727 INFO L226 Difference]: Without dead ends: 36293 [2019-12-27 07:54:06,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-27 07:54:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36293 states. [2019-12-27 07:54:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36293 to 22960. [2019-12-27 07:54:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22960 states. [2019-12-27 07:54:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22960 states to 22960 states and 70226 transitions. [2019-12-27 07:54:07,148 INFO L78 Accepts]: Start accepts. Automaton has 22960 states and 70226 transitions. Word has length 67 [2019-12-27 07:54:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:07,148 INFO L462 AbstractCegarLoop]: Abstraction has 22960 states and 70226 transitions. [2019-12-27 07:54:07,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:54:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22960 states and 70226 transitions. [2019-12-27 07:54:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:54:07,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:07,172 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 07:54:07,172 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:54:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 10 times [2019-12-27 07:54:07,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:07,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286219554] [2019-12-27 07:54:07,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:54:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:54:07,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:54:07,272 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:54:07,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2293~0.base_23|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_23| 1) |v_#valid_64|) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2293~0.base_23| 4) |v_#length_23|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_23|) |v_ULTIMATE.start_main_~#t2293~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 |v_ULTIMATE.start_main_~#t2293~0.offset_17|) (= 0 v_~z$r_buff1_thd1~0_16) (= (select .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_23|) 0) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_18|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_17|, ULTIMATE.start_main_~#t2293~0.base=|v_ULTIMATE.start_main_~#t2293~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t2293~0.offset=|v_ULTIMATE.start_main_~#t2293~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~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_77, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~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_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, ~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, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2295~0.base, ~y~0, ULTIMATE.start_main_~#t2294~0.offset, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2293~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, 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_~#t2293~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, ULTIMATE.start_main_~#t2294~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 07:54:07,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9|) |v_ULTIMATE.start_main_~#t2294~0.offset_8| 1))) (= 0 |v_ULTIMATE.start_main_~#t2294~0.offset_8|) (not (= |v_ULTIMATE.start_main_~#t2294~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2294~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) 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|, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2294~0.base, #length, ULTIMATE.start_main_~#t2294~0.offset] because there is no mapped edge [2019-12-27 07:54:07,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.offset_Out-1355499747 |P0Thread1of1ForFork0_#in~arg.offset_In-1355499747|) (= ~z$w_buff0_used~0_Out-1355499747 1) (= 0 (mod ~z$w_buff1_used~0_Out-1355499747 256)) (= ~z$w_buff0~0_Out-1355499747 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1355499747| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1355499747) (= P0Thread1of1ForFork0_~arg.base_Out-1355499747 |P0Thread1of1ForFork0_#in~arg.base_In-1355499747|) (= ~z$w_buff1_used~0_Out-1355499747 ~z$w_buff0_used~0_In-1355499747) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1355499747| 1) (= ~z$w_buff0~0_In-1355499747 ~z$w_buff1~0_Out-1355499747)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1355499747|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1355499747, ~z$w_buff0~0=~z$w_buff0~0_In-1355499747, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1355499747|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1355499747|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1355499747, ~z$w_buff0~0=~z$w_buff0~0_Out-1355499747, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1355499747, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1355499747, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1355499747|, ~z$w_buff1~0=~z$w_buff1~0_Out-1355499747, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1355499747, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1355499747|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1355499747} 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 07:54:07,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2295~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11|) |v_ULTIMATE.start_main_~#t2295~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t2295~0.offset_9|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11| 1) |v_#valid_40|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2295~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2295~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_9|, #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_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2295~0.base] because there is no mapped edge [2019-12-27 07:54:07,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2145644676 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out2145644676| |P1Thread1of1ForFork1_#t~ite9_Out2145644676|)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2145644676 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In2145644676 |P1Thread1of1ForFork1_#t~ite9_Out2145644676|)) (and (= ~z$w_buff1~0_In2145644676 |P1Thread1of1ForFork1_#t~ite9_Out2145644676|) (not .cse1) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2145644676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2145644676, ~z$w_buff1~0=~z$w_buff1~0_In2145644676, ~z~0=~z~0_In2145644676} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2145644676|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2145644676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2145644676, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out2145644676|, ~z$w_buff1~0=~z$w_buff1~0_In2145644676, ~z~0=~z~0_In2145644676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 07:54:07,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1186155961 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1186155961 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1186155961| ~z$w_buff0_used~0_In-1186155961)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1186155961|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1186155961, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1186155961} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1186155961, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1186155961|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1186155961} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:54:07,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1603774430 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1603774430 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1603774430 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1603774430 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1603774430| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out1603774430| ~z$w_buff1_used~0_In1603774430)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1603774430, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1603774430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603774430, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1603774430} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1603774430, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1603774430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603774430, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1603774430|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1603774430} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:54:07,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2137092022 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In2137092022 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out2137092022|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2137092022 |P1Thread1of1ForFork1_#t~ite13_Out2137092022|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2137092022, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2137092022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2137092022, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2137092022|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2137092022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:54:07,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In753550369 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In753550369| |P2Thread1of1ForFork2_#t~ite23_Out753550369|) (= |P2Thread1of1ForFork2_#t~ite24_Out753550369| ~z$w_buff1~0_In753550369) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite23_Out753550369| ~z$w_buff1~0_In753550369) (= |P2Thread1of1ForFork2_#t~ite24_Out753550369| |P2Thread1of1ForFork2_#t~ite23_Out753550369|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In753550369 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In753550369 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In753550369 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In753550369 256)) .cse1))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In753550369|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In753550369, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In753550369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In753550369, ~z$w_buff1~0=~z$w_buff1~0_In753550369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In753550369, ~weak$$choice2~0=~weak$$choice2~0_In753550369} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out753550369|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out753550369|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In753550369, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In753550369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In753550369, ~z$w_buff1~0=~z$w_buff1~0_In753550369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In753550369, ~weak$$choice2~0=~weak$$choice2~0_In753550369} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 07:54:07,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1143450486 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In1143450486| |P2Thread1of1ForFork2_#t~ite26_Out1143450486|) (= |P2Thread1of1ForFork2_#t~ite27_Out1143450486| ~z$w_buff0_used~0_In1143450486) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out1143450486| |P2Thread1of1ForFork2_#t~ite27_Out1143450486|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1143450486 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1143450486 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1143450486 256))) (= (mod ~z$w_buff0_used~0_In1143450486 256) 0))) (= |P2Thread1of1ForFork2_#t~ite26_Out1143450486| ~z$w_buff0_used~0_In1143450486)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1143450486|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1143450486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1143450486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143450486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1143450486, ~weak$$choice2~0=~weak$$choice2~0_In1143450486} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1143450486|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1143450486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1143450486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143450486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1143450486, ~weak$$choice2~0=~weak$$choice2~0_In1143450486, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1143450486|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 07:54:07,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In18917255 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In18917255 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In18917255 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In18917255 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In18917255 |P1Thread1of1ForFork1_#t~ite14_Out18917255|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out18917255|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In18917255, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In18917255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18917255, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In18917255} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In18917255, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In18917255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18917255, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out18917255|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In18917255} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:54:07,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, 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 07:54:07,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1505643978 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out1505643978| ~z$w_buff1_used~0_In1505643978) .cse0 (= |P2Thread1of1ForFork2_#t~ite30_Out1505643978| |P2Thread1of1ForFork2_#t~ite29_Out1505643978|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1505643978 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1505643978 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1505643978 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1505643978 256)))))) (and (= |P2Thread1of1ForFork2_#t~ite30_Out1505643978| ~z$w_buff1_used~0_In1505643978) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In1505643978| |P2Thread1of1ForFork2_#t~ite29_Out1505643978|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1505643978, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1505643978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505643978, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1505643978, ~weak$$choice2~0=~weak$$choice2~0_In1505643978, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1505643978|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1505643978|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1505643978, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1505643978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505643978, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1505643978, ~weak$$choice2~0=~weak$$choice2~0_In1505643978, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1505643978|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 07:54:07,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~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_51, ~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 07:54:07,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) 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_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 07:54:07,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In696354751 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In696354751 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out696354751| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out696354751| ~z$w_buff0_used~0_In696354751) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In696354751, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In696354751} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out696354751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In696354751, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In696354751} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:54:07,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-385958606 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-385958606 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-385958606 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-385958606 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-385958606| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-385958606 |P0Thread1of1ForFork0_#t~ite6_Out-385958606|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-385958606, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-385958606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-385958606, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-385958606} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-385958606|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-385958606, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-385958606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-385958606, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-385958606} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:54:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-961841137 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-961841137 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-961841137 ~z$r_buff0_thd1~0_Out-961841137)) (and (= 0 ~z$r_buff0_thd1~0_Out-961841137) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-961841137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-961841137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-961841137, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-961841137|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-961841137} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:54:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1421617459 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1421617459 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1421617459 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1421617459 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1421617459 |P0Thread1of1ForFork0_#t~ite8_Out1421617459|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1421617459|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1421617459, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1421617459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1421617459, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1421617459} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1421617459, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1421617459|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1421617459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1421617459, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1421617459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:54:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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 07:54:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-298132711 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-298132711 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-298132711| |P2Thread1of1ForFork2_#t~ite39_Out-298132711|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-298132711| ~z~0_In-298132711) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-298132711| ~z$w_buff1~0_In-298132711) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-298132711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298132711, ~z$w_buff1~0=~z$w_buff1~0_In-298132711, ~z~0=~z~0_In-298132711} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-298132711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298132711, ~z$w_buff1~0=~z$w_buff1~0_In-298132711, ~z~0=~z~0_In-298132711, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-298132711|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-298132711|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 07:54:07,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In287325031 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In287325031 256) 0))) (or (and (= ~z$w_buff0_used~0_In287325031 |P2Thread1of1ForFork2_#t~ite40_Out287325031|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out287325031| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In287325031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In287325031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In287325031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In287325031, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out287325031|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 07:54:07,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1311986541 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1311986541 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1311986541 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1311986541 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1311986541 |P2Thread1of1ForFork2_#t~ite41_Out1311986541|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1311986541|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1311986541, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1311986541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1311986541, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1311986541} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1311986541|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1311986541, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1311986541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1311986541, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1311986541} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 07:54:07,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1175904190 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1175904190 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1175904190|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-1175904190| ~z$r_buff0_thd3~0_In-1175904190)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1175904190, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1175904190} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1175904190|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1175904190, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1175904190} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 07:54:07,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In1744418625 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1744418625 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1744418625 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1744418625 256)))) (or (and (= ~z$r_buff1_thd3~0_In1744418625 |P2Thread1of1ForFork2_#t~ite43_Out1744418625|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1744418625|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1744418625, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1744418625, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1744418625, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1744418625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1744418625, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1744418625, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1744418625|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1744418625, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1744418625} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 07:54:07,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 07:54:07,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:54:07,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2077863192 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2077863192 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out2077863192| |ULTIMATE.start_main_#t~ite47_Out2077863192|))) (or (and (= ~z$w_buff1~0_In2077863192 |ULTIMATE.start_main_#t~ite47_Out2077863192|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In2077863192 |ULTIMATE.start_main_#t~ite47_Out2077863192|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2077863192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077863192, ~z$w_buff1~0=~z$w_buff1~0_In2077863192, ~z~0=~z~0_In2077863192} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2077863192, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2077863192|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077863192, ~z$w_buff1~0=~z$w_buff1~0_In2077863192, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2077863192|, ~z~0=~z~0_In2077863192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:54:07,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In93989617 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In93989617 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out93989617| ~z$w_buff0_used~0_In93989617) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out93989617| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In93989617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In93989617} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In93989617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In93989617, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out93989617|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:54:07,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1075132912 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1075132912 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1075132912 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1075132912 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1075132912|)) (and (= ~z$w_buff1_used~0_In-1075132912 |ULTIMATE.start_main_#t~ite50_Out-1075132912|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1075132912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1075132912, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1075132912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1075132912} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1075132912|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1075132912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1075132912, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1075132912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1075132912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 07:54:07,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-74966148 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-74966148 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-74966148 |ULTIMATE.start_main_#t~ite51_Out-74966148|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-74966148|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-74966148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-74966148} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-74966148, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-74966148|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-74966148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 07:54:07,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In866347488 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In866347488 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In866347488 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In866347488 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In866347488 |ULTIMATE.start_main_#t~ite52_Out866347488|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out866347488| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In866347488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In866347488, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In866347488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In866347488} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out866347488|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In866347488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In866347488, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In866347488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In866347488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 07:54:07,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 07:54:07,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:54:07 BasicIcfg [2019-12-27 07:54:07,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:54:07,509 INFO L168 Benchmark]: Toolchain (without parser) took 139464.18 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,509 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.62 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.2 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.54 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,510 INFO L168 Benchmark]: Boogie Preprocessor took 44.26 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,510 INFO L168 Benchmark]: RCFGBuilder took 861.81 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 102.7 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,510 INFO L168 Benchmark]: TraceAbstraction took 137744.48 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:54:07,512 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.48 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.62 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.2 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.54 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.26 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.81 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 102.7 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 137744.48 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). 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: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 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(&t2293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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(&t2294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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(&t2295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [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 __unbuffered_p2_EAX = y [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_p2_EAX=1, __unbuffered_p2_EBX=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_p2_EAX=1, __unbuffered_p2_EBX=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_p2_EAX=1, __unbuffered_p2_EBX=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_p2_EAX=1, __unbuffered_p2_EBX=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_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_p2_EAX=1, __unbuffered_p2_EBX=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_p2_EAX=1, __unbuffered_p2_EBX=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: 137.2s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 63.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9603 SDtfs, 14757 SDslu, 41551 SDs, 0 SdLazy, 34477 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 696 GetRequests, 53 SyntacticMatches, 42 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 46.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 431501 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1952 NumberOfCodeBlocks, 1952 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1849 ConstructedInterpolants, 0 QuantifiedInterpolants, 524117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...